Implicit contacts in an online social network

ABSTRACT

In one embodiment, a method includes accessing a social graph including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent a single degree of separation between them. The nodes include a first node corresponding to a first user associated with an online social network and a number of second nodes that each correspond to a concept or a second user associated with the online social network. The method also includes generating a user-list containing references to a number of second users. A contact-score for each second user may be calculated based on interactions between the first user and second user on the online social network, or interactions not on the online social network but accessed by the online social network. A user-list is generated containing references to second users with contact-scores above a threshold contact-score.

TECHNICAL FIELD

This disclosure generally relates to presentation of information on acomputing device within a social-networking environment or relatedenvironments.

BACKGROUND

A social-networking system, which may include a social-networkingwebsite, may enable its users (such as persons or organizations) tointeract with it and with each other through it. The social-networkingsystem may, with input from a user, create and store in thesocial-networking system a user profile associated with the user. Theuser profile may include demographic information, communication-channelinformation, and information on personal interests of the user. Thesocial-networking system may also, with input from a user, create andstore a record of relationships of the user with other users of thesocial-networking system, as well as provide services (e.g., wall posts,photo-sharing, event organization, messaging, games, or advertisements)to facilitate social interaction between or among users.

The social-networking system may send over one or more networks contentor messages related to its services to a mobile or other computingdevice of a user. A user may also install software applications on amobile or other computing device of the user for accessing a userprofile of the user and other data within the social-networking system.The social-networking system may generate a personalized set of contentobjects to display to a user, such as a newsfeed of aggregated storiesof other users connected to the user.

Social-graph analysis views social relationships in terms of networktheory consisting of nodes and edges. Nodes represent the individualactors within the networks, and edges represent the relationshipsbetween the actors. The resulting graph-based structures are often verycomplex. There can be many types of nodes and many types of edges forconnecting nodes. In its simplest form, a social graph is a map of allof the relevant edges between all the nodes being studied.

A mobile computing device—such as a smartphone, tablet computer, orlaptop computer—may include functionality for determining its location,direction, or orientation, such as a GPS receiver, compass, orgyroscope. Such a device may also include functionality for wirelesscommunication, such as BLUETOOTH communication, near-field communication(NFC), or infrared (IR) communication or communication with a wirelesslocal area networks (WLANs) or cellular-telephone network. Such a devicemay also include one or more cameras, scanners, touchscreens,microphones, or speakers. Mobile computing devices may also executesoftware applications, such as games, web browsers, or social-networkingapplications. With social-networking applications, users may connect,communicate, and share information with other users in their socialnetworks.

SUMMARY OF PARTICULAR EMBODIMENTS

In particular embodiments, a social-networking system may generatestructured queries that include references to particular social-graphelements. These structured queries may be generated, for example, inresponse to a text query provided by a first user, generated as defaultqueries based on an input from the first user, or generated as defaultqueries automatically without input from the first user. By generatingstructured queries without explicit user input, the social-networkingsystem may provide a powerful way for users of an online social networkto view elements in a social graph that they may desire to view withoutcreating an express text query for those elements.

In particular embodiments, the user-card interface may be a visual modelindicating which other users are associated with particular concepts orentities on the social graph. The first user may be presented with oneor more user-cards, where each user-card corresponds to a structuredquery of the social graph. Each user-card will contain references to oneor more second users who match the structured query for that user-card.This allows the first user to view users grouped by particular ideas orcategories. For example, the first user may view user-cards for “PeopleWith Upcoming Birthdays,” or “Watching a Movie Right Now,” and see oneor more second users who correspond to those categories. References toone or more second users may be displayed within each user-card. Thefirst user may select a user-card to look at more second users that maybe displayed within the user-card, and may select particular secondusers to view more information about the second user or to interact withthe second user. Additional interactive elements for interacting withthe user-card or individual second users may be displayed. The firstuser may indicate a preference for particular user-cards. The first usermay indicate a preference to not view particular user-cards, and thoseuser-cards will be removed from the user-card interface.

In particular embodiments, a user-card score for each user-card may becalculated. The user-card score may be based at least in part on therelevance of the structured query corresponding to the user-card to thefirst user. The user-card score may be based at least in part on acalculated likelihood that the first user will interact with theuser-card. The user-card score may be based at least in part on thecurrent or future geographic location of the first user. The user-cardscore may be calculated based at least in part on any other factorsrecorded by the social-networking system that may indicate an affinityfor the first user with respect to the contents of the user-card. Inparticular embodiments, only user-cards with user-card scores exceedinga threshold user-card score may be displayed in the user-card interface.In particular embodiments, the user-cards displayed in the user-cardinterface may be arranged in a ranked list according to their user-cardscores.

In particular embodiments, the social-networking system may calculate auser-score for each second user displayed in a user-card. The user-scorefor a second user may be based at least in part on the affinity of thefirst user with respect to the second user. The user-score for a seconduser may be based at least in part on the affinity of the second userwith respect to the nodes referenced by the structured querycorresponding to the user-card.

In particular embodiments, the first user may apply a query-filter toone or more user-cards. The query-filter may reference additional nodesor edges of the social graph, or remove existing references. Thesocial-networking system may update the generated user-cards based onthe query-filter. The user-card scores for each user-card may be updatedbased on the query-filter. The user-scores for each second user may beupdated based on the query-filter. The user-cards may be re-ranked basedon their updated user-card scores. The second users may be re-rankedbased on their updated user-scores.

In particular embodiments, the first user may indicate that he or shealso belongs to a particular user-card. In response, thesocial-networking system may update the generated user-cards based onthe query-filter. The user-card scores for each user-card may be updatedbased on the query-filter. The user-scores for each second user may beupdated based on the query-filter. The user-cards may be re-ranked basedon their updated user-card scores. The second users may be re-rankedbased on their updated user-scores. The social-networking system mayassociate the first user with the structured query corresponding to thatuser-card, placing the first user in similar user-cards viewed by otherusers.

In particular embodiments, the second users in the user-cards may bedrawn from all users of the social-networking system based on amulti-signal social affinity determined with respect to the first user.The multi-signal social affinity may be used to calculate acontact-score for each user. The contact-score may be used to determineif the second user is known to the first user. A second user having acontact-score above a threshold contact-score may be placed in auser-list for the first user. The first user may be able to view theuser-list containing all second users determined to be known to thefirst user. The first user may interact with the displayed second users,and may remove particular second users from the user-list. Thesocial-networking system may use the user-list when generatinguser-cards for the first user.

Although the term “user-card” is used to describe this invention, theconcept of this invention is applicable to all social graph entities,and even third-party entities.

The embodiments disclosed above are only examples, and the scope of thisdisclosure is not limited to them. Particular embodiments may includeall, some, or none of the components, elements, features, functions,operations, or steps of the embodiments disclosed above.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example network environment associated with asocial-networking system.

FIG. 2 illustrates an example social graph.

FIG. 3 illustrates an example mobile client system.

FIG. 4 illustrates an example user-card interface for displayinguser-cards.

FIG. 5 illustrates an example method for generating user-cards.

FIG. 6 illustrates an example method for ranking user-cards.

FIG. 7 illustrates an example method for ranking users in a user-card.

FIG. 8 illustrates an example query-filter for a user-card interface.

FIG. 9 illustrates an example user-card interface with differentinteraction options for each user-card.

FIG. 10 illustrates an example user-card interface with a user-cardremoved.

FIG. 11 illustrates an example user-list for all user contacts of afirst user.

FIG. 12 illustrates an example method for updating a user-list based onassociation information.

FIG. 13 illustrates an example user-list filtered for users with recentinteractions.

FIG. 14 illustrates an example computer system.

DESCRIPTION OF EXAMPLE EMBODIMENTS

System Overview

FIG. 1 illustrates an example network environment 100 associated with asocial-networking system. Network environment 100 includes a clientsystem 130, a social-networking system 160, and a third-party system 170connected to each other by a network 110. Although FIG. 1 illustrates aparticular arrangement of client system 130, social-networking system160, third-party system 170, and network 110, this disclosurecontemplates any suitable arrangement of client system 130,social-networking system 160, third-party system 170, and network 110.As an example and not by way of limitation, two or more of client system130, social-networking system 160, and third-party system 170 may beconnected to each other directly, bypassing network 110. As anotherexample, two or more of client system 130, social-networking system 160,and third-party system 170 may be physically or logically co-locatedwith each other in whole or in part. Moreover, although FIG. 1illustrates a particular number of client systems 130, social-networkingsystems 160, third-party systems 170, and networks 110, this disclosurecontemplates any suitable number of client systems 130,social-networking systems 160, third-party systems 170, and networks110. As an example and not by way of limitation, network environment 100may include multiple client system 130, social-networking systems 160,third-party systems 170, and networks 110.

This disclosure contemplates any suitable network 110. As an example andnot by way of limitation, one or more portions of network 110 mayinclude an ad hoc network, an intranet, an extranet, a virtual privatenetwork (VPN), a local area network (LAN), a wireless LAN (WLAN), a widearea network (WAN), a wireless WAN (WWAN), a metropolitan area network(MAN), a portion of the Internet, a portion of the Public SwitchedTelephone Network (PSTN), a cellular telephone network, or a combinationof two or more of these. Network 110 may include one or more networks110.

Links 150 may connect client system 130, social-networking system 160,and third-party system 170 to communication network 110 or to eachother. This disclosure contemplates any suitable links 150. Inparticular embodiments, one or more links 150 include one or morewireline (such as for example Digital Subscriber Line (DSL) or Data OverCable Service Interface Specification (DOCSIS)), wireless (such as forexample Wi-Fi or Worldwide Interoperability for Microwave Access(WiMAX)), or optical (such as for example Synchronous Optical Network(SONET) or Synchronous Digital Hierarchy (SDH)) links. In particularembodiments, one or more links 150 each include an ad hoc network, anintranet, an extranet, a VPN, a LAN, a WLAN, a WAN, a WWAN, a MAN, aportion of the Internet, a portion of the PSTN, a cellulartechnology-based network, a satellite communications technology-basednetwork, another link 150, or a combination of two or more such links150. Links 150 need not necessarily be the same throughout networkenvironment 100. One or more first links 150 may differ in one or morerespects from one or more second links 150.

In particular embodiments, client system 130 may be an electronic deviceincluding hardware, software, or embedded logic components or acombination of two or more such components and capable of carrying outthe appropriate functionalities implemented or supported by clientsystem 130. As an example and not by way of limitation, a client system130 may include a computer system such as a desktop computer, notebookor laptop computer, netbook, a tablet computer, e-book reader, GPSdevice, camera, personal digital assistant (PDA), handheld electronicdevice, cellular telephone, smartphone, other suitable electronicdevice, or any suitable combination thereof. This disclosurecontemplates any suitable client systems 130. A client system 130 mayenable a network user at client system 130 to access network 110. Aclient system 130 may enable its user to communicate with other users atother client systems 130.

In particular embodiments, client system 130 may include a web browser132, such as MICROSOFT INTERNET EXPLORER, GOOGLE CHROME or MOZILLAFIREFOX, and may have one or more add-ons, plug-ins, or otherextensions, such as TOOLBAR or YAHOO TOOLBAR. A user at client system130 may enter a Uniform Resource Locator (URL) or other addressdirecting the web browser 132 to a particular server (such as server162, or a server associated with a third-party system 170), and the webbrowser 132 may generate a Hyper Text Transfer Protocol (HTTP) requestand communicate the HTTP request to server. The server may accept theHTTP request and communicate to client system 130 one or more Hyper TextMarkup Language (HTML) files responsive to the HTTP request. Clientsystem 130 may render a webpage based on the HTML files from the serverfor presentation to the user. This disclosure contemplates any suitablewebpage files. As an example and not by way of limitation, webpages mayrender from HTML files, Extensible Hyper Text Markup Language (XHTML)files, or Extensible Markup Language (XML) files, according toparticular needs. Such pages may also execute scripts such as, forexample and without limitation, those written in JAVASCRIPT, JAVA,MICROSOFT SILVERLIGHT, combinations of markup language and scripts suchas AJAX (Asynchronous JAVASCRIPT and XML), and the like. Herein,reference to a webpage encompasses one or more corresponding webpagefiles (which a browser may use to render the webpage) and vice versa,where appropriate.

In particular embodiments, social-networking system 160 may be anetwork-addressable computing system that can host an online socialnetwork.

Social-networking system 160 may generate, store, receive, and sendsocial-networking data, such as, for example, user-profile data,concept-profile data, social-graph information, or other suitable datarelated to the online social network. Social-networking system 160 maybe accessed by the other components of network environment 100 eitherdirectly or via network 110. In particular embodiments,social-networking system 160 may include one or more servers 162. Eachserver 162 may be a unitary server or a distributed server spanningmultiple computers or multiple datacenters. Servers 162 may be ofvarious types, such as, for example and without limitation, web server,news server, mail server, message server, advertising server, fileserver, application server, exchange server, database server, proxyserver, another server suitable for performing functions or processesdescribed herein, or any combination thereof. In particular embodiments,each server 162 may include hardware, software, or embedded logiccomponents or a combination of two or more such components for carryingout the appropriate functionalities implemented or supported by server162. In particular embodiments, social-networking system 164 may includeone or more data stores 164. Data stores 164 may be used to storevarious types of information. In particular embodiments, the informationstored in data stores 164 may be organized according to specific datastructures. In particular embodiments, each data store 164 may be arelational, columnar, correlation, or other suitable database. Althoughthis disclosure describes or illustrates particular types of databases,this disclosure contemplates any suitable types of databases. Particularembodiments may provide interfaces that enable a client system 130, asocial-networking system 160, or a third-party system 170 to manage,retrieve, modify, add, or delete, the information stored in data store164.

In particular embodiments, social-networking system 160 may store one ormore social graphs in one or more data stores 164. In particularembodiments, a social graph may include multiple nodes—which may includemultiple user nodes (each corresponding to a particular user) ormultiple concept nodes (each corresponding to a particular concept)—andmultiple edges connecting the nodes. Social-networking system 160 mayprovide users of the online social network the ability to communicateand interact with other users. In particular embodiments, users may jointhe online social network via social-networking system 160 and then addconnections (e.g., relationships) to a number of other users ofsocial-networking system 160 whom they want to be connected to. Herein,the term “friend” may refer to any other user of social-networkingsystem 160 with whom a user has formed a connection, association, orrelationship via social-networking system 160.

In particular embodiments, social-networking system 160 may provideusers with the ability to take actions on various types of items orobjects, supported by social-networking system 160. As an example andnot by way of limitation, the items and objects may include groups orsocial networks to which users of social-networking system 160 maybelong, events or calendar entries in which a user might be interested,computer-based applications that a user may use, transactions that allowusers to buy or sell items via the service, interactions withadvertisements that a user may perform, or other suitable items orobjects. A user may interact with anything that is capable of beingrepresented in social-networking system 160 or by an external system ofthird-party system 170, which is separate from social-networking system160 and coupled to social-networking system 160 via a network 110.

In particular embodiments, social-networking system 160 may be capableof linking a variety of entities. As an example and not by way oflimitation, social-networking system 160 may enable users to interactwith each other as well as receive content from third-party systems 170or other entities, or to allow users to interact with these entitiesthrough an application programming interfaces (API) or othercommunication channels.

In particular embodiments, a third-party system 170 may include one ormore types of servers, one or more data stores, one or more interfaces,including but not limited to APIs, one or more web services, one or morecontent sources, one or more networks, or any other suitable components,e.g., that servers may communicate with. A third-party system 170 may beoperated by a different entity from an entity operatingsocial-networking system 160. In particular embodiments, however,social-networking system 160 and third-party systems 170 may operate inconjunction with each other to provide social-networking services tousers of social-networking system 160 or third-party systems 170. Inthis sense, social-networking system 160 may provide a platform, orbackbone, which other systems, such as third-party systems 170, may useto provide social-networking services and functionality to users acrossthe Internet.

In particular embodiments, a third-party system 170 may include athird-party content object provider. A third-party content objectprovider may include one or more sources of content objects, which maybe communicated to a client system 130. As an example and not by way oflimitation, content objects may include information regarding things oractivities of interest to the user, such as, for example, movie showtimes, movie reviews, restaurant reviews, restaurant menus, productinformation and reviews, or other suitable information. As anotherexample and not by way of limitation, content objects may includeincentive content objects, such as coupons, discount tickets, giftcertificates, or other suitable incentive objects.

In particular embodiments, social-networking system 160 also includesuser-generated content objects, which may enhance a user's interactionswith social-networking system 160. User-generated content may includeanything a user can add, upload, send, or “post” to social-networkingsystem 160. As an example and not by way of limitation, a usercommunicates posts to social-networking system 160 from a client system130. Posts may include data such as status updates or other textualdata, location information, photos, videos, links, music or othersimilar data or media. Content may also be added to social-networkingsystem 160 by a third-party through a “communication channel,” such as anewsfeed or stream.

In particular embodiments, social-networking system 160 may include avariety of servers, sub-systems, programs, modules, logs, and datastores. In particular embodiments, social-networking system 160 mayinclude one or more of the following: a web server, action logger,API-request server, relevance-and-ranking engine, content-objectclassifier, notification controller, action log,third-party-content-object-exposure log, inference module,authorization/privacy server, search module, advertisement-targetingmodule, user-interface module, user-profile store, connection store,third-party content store, or location store. Social-networking system160 may also include suitable components such as network interfaces,security mechanisms, load balancers, failover servers,management-and-network-operations consoles, other suitable components,or any suitable combination thereof. In particular embodiments,social-networking system 160 may include one or more user-profile storesfor storing user profiles. A user profile may include, for example,biographic information, demographic information, behavioral information,social information, or other types of descriptive information, such aswork experience, educational history, hobbies or preferences, interests,affinities, or location. Interest information may include interestsrelated to one or more categories. Categories may be general orspecific. As an example and not by way of limitation, if a user “likes”an article about a brand of shoes the category may be the brand, or thegeneral category of “shoes” or “clothing.” A connection store may beused for storing connection information about users. The connectioninformation may indicate users who have similar or common workexperience, group memberships, hobbies, educational history, or are inany way related or share common attributes. The connection informationmay also include user-defined connections between different users andcontent (both internal and external). A web server may be used forlinking social-networking system 160 to one or more client systems 130or one or more third-party system 170 via network 110. The web servermay include a mail server or other messaging functionality for receivingand routing messages between social-networking system 160 and one ormore client systems 130. An API-request server may allow a third-partysystem 170 to access information from social-networking system 160 bycalling one or more APIs. An action logger may be used to receivecommunications from a web server about a user's actions on or offsocial-networking system 160. In conjunction with the action log, athird-party-content-object log may be maintained of user exposures tothird-party-content objects. A notification controller may provideinformation regarding content objects to a client system 130.Information may be pushed to a client system 130 as notifications, orinformation may be pulled from client system 130 responsive to a requestreceived from client system 130. Authorization servers may be used toenforce one or more privacy settings of the users of social-networkingsystem 160. A privacy setting of a user determines how particularinformation associated with a user can be shared. The authorizationserver may allow users to opt in to or opt out of having their actionslogged by social-networking system 160 or shared with other systems(e.g., third-party system 170), such as, for example, by settingappropriate privacy settings. Third-party-content-object stores may beused to store content objects received from third parties, such as athird-party system 170. Location stores may be used for storing locationinformation received from client systems 130 associated with users.Advertisement-pricing modules may combine social information, thecurrent time, location information, or other suitable information toprovide relevant advertisements, in the form of notifications, to auser.

Social Graphs

FIG. 2 illustrates example social graph 200. In particular embodiments,social-networking system 160 may store one or more social graphs 200 inone or more data stores. In particular embodiments, social graph 200 mayinclude multiple nodes—which may include multiple user nodes 202 ormultiple concept nodes 204—and multiple edges 206 connecting the nodes.Example social graph 200 illustrated in FIG. 2 is shown, for didacticpurposes, in a two-dimensional visual map representation. In particularembodiments, a social-networking system 160, client system 130, orthird-party system 170 may access social graph 200 and relatedsocial-graph information for suitable applications. The nodes and edgesof social graph 200 may be stored as data objects, for example, in adata store (such as a social-graph database). Such a data store mayinclude one or more searchable or queryable indexes of nodes or edges ofsocial graph 200.

In particular embodiments, a user node 202 may correspond to a user ofsocial-networking system 160. As an example and not by way oflimitation, a user may be an individual (human user), an entity (e.g.,an enterprise, business, or third-party application), or a group (e.g.,of individuals or entities) that interacts or communicates with or oversocial-networking system 160. In particular embodiments, when a userregisters for an account with social-networking system 160,social-networking system 160 may create a user node 202 corresponding tothe user, and store the user node 202 in one or more data stores. Usersand user nodes 202 described herein may, where appropriate, refer toregistered users and user nodes 202 associated with registered users. Inaddition or as an alternative, users and user nodes 202 described hereinmay, where appropriate, refer to users that have not registered withsocial-networking system 160. In particular embodiments, a user node 202may be associated with information provided by a user or informationgathered by various systems, including social-networking system 160. Asan example and not by way of limitation, a user may provide his or hername, profile picture, contact information, birth date, sex, maritalstatus, family status, employment, education background, preferences,interests, or other demographic information. In particular embodiments,a user node 202 may be associated with one or more data objectscorresponding to information associated with a user. In particularembodiments, a user node 202 may correspond to one or more webpages.

In particular embodiments, a concept node 204 may correspond to aconcept. As an example and not by way of limitation, a concept maycorrespond to a place (such as, for example, a movie theater,restaurant, landmark, or city); a website (such as, for example, awebsite associated with social-network system 160 or a third-partywebsite associated with a web-application server); an entity (such as,for example, a person, business, group, sports team, or celebrity); aresource (such as, for example, an audio file, video file, digitalphoto, text file, structured document, or application) which may belocated within social-networking system 160 or on an external server,such as a web-application server; real or intellectual property (suchas, for example, a sculpture, painting, movie, game, song, idea,photograph, or written work); a game; an activity; an idea or theory;another suitable concept; or two or more such concepts. A concept node204 may be associated with information of a concept provided by a useror information gathered by various systems, including social-networkingsystem 160. As an example and not by way of limitation, information of aconcept may include a name or a title; one or more images (e.g., animage of the cover page of a book); a location (e.g., an address or ageographical location); a website (which may be associated with a URL);contact information (e.g., a phone number or an email address); othersuitable concept information; or any suitable combination of suchinformation. In particular embodiments, a concept node 204 may beassociated with one or more data objects corresponding to informationassociated with concept node 204. In particular embodiments, a conceptnode 204 may correspond to one or more webpages.

In particular embodiments, a node in social graph 200 may represent orbe represented by a webpage (which may be referred to as a “profilepage”). Profile pages may be hosted by or accessible tosocial-networking system 160. Profile pages may also be hosted onthird-party websites associated with a third-party server 170. As anexample and not by way of limitation, a profile page corresponding to aparticular external webpage may be the particular external webpage andthe profile page may correspond to a particular concept node 204.Profile pages may be viewable by all or a selected subset of otherusers. As an example and not by way of limitation, a user node 202 mayhave a corresponding user-profile page in which the corresponding usermay add content, make declarations, or otherwise express himself orherself. As another example and not by way of limitation, a concept node204 may have a corresponding concept-profile page in which one or moreusers may add content, make declarations, or express themselves,particularly in relation to the concept corresponding to concept node204.

In particular embodiments, a concept node 204 may represent athird-party webpage or resource hosted by a third-party system 170. Thethird-party webpage or resource may include, among other elements,content, a selectable or other icon, or other inter-actable object(which may be implemented, for example, in JavaScript, AJAX, or PHPcodes) representing an action or activity. As an example and not by wayof limitation, a third-party webpage may include a selectable icon suchas “like,” “check in,” “eat,” “recommend,” or another suitable action oractivity. A user viewing the third-party webpage may perform an actionby selecting one of the icons (e.g., “eat”), causing a client system 130to send to social-networking system 160 a message indicating the user'saction. In response to the message, social-networking system 160 maycreate an edge (e.g., an “eat” edge) between a user node 202corresponding to the user and a concept node 204 corresponding to thethird-party webpage or resource and store edge 206 in one or more datastores.

In particular embodiments, a pair of nodes in social graph 200 may beconnected to each other by one or more edges 206. An edge 206 connectinga pair of nodes may represent a relationship between the pair of nodes.In particular embodiments, an edge 206 may include or represent one ormore data objects or attributes corresponding to the relationshipbetween a pair of nodes. As an example and not by way of limitation, afirst user may indicate that a second user is a “friend” of the firstuser. In response to this indication, social-networking system 160 maysend a “friend request” to the second user. If the second user confirmsthe “friend request,” social-networking system 160 may create an edge206 connecting the first user's user node 202 to the second user's usernode 202 in social graph 200 and store edge 206 as social-graphinformation in one or more of data stores 164. In the example of FIG. 2,social graph 200 includes an edge 206 indicating a friend relationbetween user nodes 202 of user “A” and user “B” and an edge indicating afriend relation between user nodes 202 of user “C” and user “B.”Although this disclosure describes or illustrates particular edges 206with particular attributes connecting particular user nodes 202, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202. As an example and not by way oflimitation, an edge 206 may represent a friendship, family relationship,business or employment relationship, fan relationship, followerrelationship, visitor relationship, subscriber relationship,superior/subordinate relationship, reciprocal relationship,non-reciprocal relationship, another suitable type of relationship, ortwo or more such relationships. Moreover, although this disclosuregenerally describes nodes as being connected, this disclosure alsodescribes users or concepts as being connected. Herein, references tousers or concepts being connected may, where appropriate, refer to thenodes corresponding to those users or concepts being connected in socialgraph 200 by one or more edges 206.

In particular embodiments, an edge 206 between a user node 202 and aconcept node 204 may represent a particular action or activity performedby a user associated with user node 202 toward a concept associated witha concept node 204. As an example and not by way of limitation, asillustrated in FIG. 2, a user may “like,” “attended,” “played,”“listened,” “cooked,” “worked at,” or “watched” a concept, each of whichmay correspond to an edge type or subtype. A concept-profile pagecorresponding to a concept node 204 may include, for example, aselectable “check in” icon (such as, for example, a clickable “check in”icon) or a selectable “add to favorites” icon. Similarly, after a userclicks these icons, social-networking system 160 may create a “favorite”edge or a “check in” edge in response to a user's action correspondingto a respective action. As another example and not by way of limitation,a user (user “C”) may listen to a particular song (“Ramble On”) using aparticular application (SPOTIFY, which is an online music application).In this case, social-networking system 160 may create a “listened” edge206 and a “used” edge (as illustrated in FIG. 2) between user nodes 202corresponding to the user and concept nodes 204 corresponding to thesong and application to indicate that the user listened to the song andused the application. Moreover, social-networking system 160 may createa “played” edge 206 (as illustrated in FIG. 2) between concept nodes 204corresponding to the song and the application to indicate that theparticular song was played by the particular application. In this case,“played” edge 206 corresponds to an action performed by an externalapplication (SPOTIFY) on an external audio file (the song “Imagine”).Although this disclosure describes particular edges 206 with particularattributes connecting user nodes 202 and concept nodes 204, thisdisclosure contemplates any suitable edges 206 with any suitableattributes connecting user nodes 202 and concept nodes 204. Moreover,although this disclosure describes edges between a user node 202 and aconcept node 204 representing a single relationship, this disclosurecontemplates edges between a user node 202 and a concept node 204representing one or more relationships. As an example and not by way oflimitation, an edge 206 may represent both that a user likes and hasused at a particular concept. Alternatively, another edge 206 mayrepresent each type of relationship (or multiples of a singlerelationship) between a user node 202 and a concept node 204 (asillustrated in FIG. 2 between user node 202 for user “E” and conceptnode 204 for “SPOTIFY”).

In particular embodiments, social-networking system 160 may create anedge 206 between a user node 202 and a concept node 204 in social graph200. As an example and not by way of limitation, a user viewing aconcept-profile page (such as, for example, by using a web browser or aspecial-purpose application hosted by the user's client system 130) mayindicate that he or she likes the concept represented by the conceptnode 204 by clicking or selecting a “Like” icon, which may cause theuser's client system 130 to send to social-networking system 160 amessage indicating the user's liking of the concept associated with theconcept-profile page. In response to the message, social-networkingsystem 160 may create an edge 206 between user node 202 associated withthe user and concept node 204, as illustrated by “like” edge 206 betweenthe user and concept node 204. In particular embodiments,social-networking system 160 may store an edge 206 in one or more datastores. In particular embodiments, an edge 206 may be automaticallyformed by social-networking system 160 in response to a particular useraction. As an example and not by way of limitation, if a first useruploads a picture, watches a movie, or listens to a song, an edge 206may be formed between user node 202 corresponding to the first user andconcept nodes 204 corresponding to those concepts. Although thisdisclosure describes forming particular edges 206 in particular manners,this disclosure contemplates forming any suitable edges 206 in anysuitable manner.

Mobile Client Systems

FIG. 3 illustrates an example mobile client system 130. This disclosurecontemplates mobile client system 130 taking any suitable physical form.In particular embodiments, mobile client system 130 may be a computingsystem as described below. As example and not by way of limitation,mobile client system 130 may be a single-board computer system (SBC)(such as, for example, a computer-on-module (COM) or system-on-module(SOM)), a laptop or notebook computer system, a mobile telephone, asmartphone, a personal digital assistant (PDA), a tablet computersystem, or a combination of two or more of these. In particularembodiments, mobile client system 130 may have a touch sensor 132 as aninput component. In the example of FIG. 3, touch sensor 132 isincorporated on a front surface of mobile client system 130. In the caseof capacitive touch sensors, there may be two types of electrodes:transmitting and receiving. These electrodes may be connected to acontroller designed to drive the transmitting electrodes with electricalpulses and measure the changes in capacitance from the receivingelectrodes caused by a touch or proximity input. In the example of FIG.3, one or more antennae 134A-B may be incorporated into one or moresides of mobile client system 130. Antennae 134A-B are components thatconvert electric current into radio waves, and vice versa. Duringtransmission of signals, a transmitter applies an oscillating radiofrequency (RF) electric current to terminals of antenna 134A-B, andantenna 134A-B radiates the energy of the applied the current aselectromagnetic (EM) waves. During reception of signals, antennae 134A-Bconvert the power of an incoming EM wave into a voltage at the terminalsof antennae 134A-B. The voltage may be transmitted to a receiver foramplification.

In particular embodiments, mobile client system 130 many include acommunication component coupled to antennae 134A-B for communicatingwith an Ethernet or other wire-based network or a wireless NIC (WNIC),wireless adapter for communicating with a wireless network, such as forexample a WI-FI network or modem for communicating with a cellularnetwork, such third generation mobile telecommunications (3G), or LongTerm Evolution (LTE) network. This disclosure contemplates any suitablenetwork and any suitable communication component 20 for it. As anexample and not by way of limitation, mobile client system 130 maycommunicate with an ad hoc network, a personal area network (PAN), alocal area network (LAN), a wide area network (WAN), a metropolitan areanetwork (MAN), or one or more portions of the Internet or a combinationof two or more of these. One or more portions of one or more of thesenetworks may be wired or wireless. As another example, mobile clientsystem 130 may communicate with a wireless PAN (WPAN) (such as, forexample, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, acellular telephone network (such as, for example, a Global System forMobile Communications (GSM), 3G, or LTE network), or other suitablewireless network or a combination of two or more of these. Mobile clientsystem 130 may include any suitable communication component for any ofthese networks, where appropriate.

In particular embodiments, the communication component coupled toantennae 134A-B mobile client system 130 may be configured to determinelocation data based on global positioning system (GPS) signals, cellulartriangulation, wireless hotspots, or any suitable methods fordetermining location data. In particular embodiments, the locationservice of mobile client system 130 may use one or more methods oflocation determination, such as for example, using the location of oneor more cellular towers, crowd-sourced location information associatedwith a WI-FI hotspot, or a GPS function of mobile client system 130. Asan example and not by way of limitation, the application may use GPSdata as the primary source of location information depending at least inpart on whether mobile client system 130 is able to acquire GPS datawithin a pre-determined period of time. As another example, if mobileclient system 130 is unable to acquire the GPS data within thepre-determined sampling duration, the application may use the locationdetermined using one or more cellular towers or WI-FI hotspots. Althoughthis disclosure describes a location service using particular methods oflocation determination, this disclosure contemplates a location serviceusing any suitable method or combination of methods of locationdetection.

User Cards

FIG. 4 illustrates an example user-card interface. One or more“user-cards” 430A-C of a user-card interface 410 may be displayed indisplay area 400 of a mobile client system 130 belonging to a first userof a social-networking system. In the example of FIG. 4, each user-card430A-C corresponds to a structured query of the social graph 200. Eachuser-card 430A-C may include one or more references 440 to one or moresecond users who correspond to one or more node that match thestructured query. As an example and not by way of limitation, user-card430A may correspond to a structured query for users who have made afriend request to the first user. In particular embodiments, thereferences 440 to one or more second users may comprise a profile image,name, e-mail address and other contact information, a user ID, or otherinformation relating to the second user's profile in thesocial-networking system 160. User-card 430A displays a natural-languagetitle for the particular structured query, such as in the example ofFIG. 4, “Friend Requests”, and displays at least one reference 440 to asecond user corresponding to that particular graph query. The first usermay then interact with the user-card 430A to view more references tosecond users corresponding to the user-card, or interact directly withthe references 440 or interactive elements 442 that are displayed foreach second user. In the example of FIG. 4, user-card 430B correspondsto a structured query for users with a birthday matching the currentdate. In particular embodiments, selecting a user-card 430A may presentthe user with a new interface for accessing additional contentassociated with user-card 430A. In particular embodiments, selecting theuser-card 430A may simply expand the display of user-card 430A withinthe example user-card interface 410. As an example and not by way oflimitation, user-cards 430A-C may include: People You May Know; FriendRequests; Friends with Birthday Today; Life Events or Recent Moments;Friends with Upcoming Birthdays; Local Check-Ins; Check-Ins Near [aparticular location]; People Traveling Now; People You've Contacted;Name Days; Anniversaries (e.g. work, personal, etc.); People Visitingfrom Out of Town; People Visiting [a particular city]; Local People in[city the first user is visiting]; People from Where You Are (e.g.people whose hometown the first user is currently in); People CurrentlyAt the Same Event As You; People Going to the Same Event in the Future;Who is Hungry (and Nearby); Who's Watching What You Are; Who's PlayingWhat You're Playing; Who's at the Game (e.g. who is also attending thesame sporting event as the first user); People with RelationshipChanges/Break-Ups; List of Favorites (e.g. people the first user hasmarked as favorites); People Travelling to the Same Place as You in theFuture (e.g. if a second user will be in New York City at the same timein the future as the first user); Upcoming Graduations; GraduationsToday; Friendversaries (e.g. the anniversary of the date that a firstuser became friends with a second user on the social-networking system);Work Updates (e.g. changes to job titles); People Who Just Moved To YourHometown; People Who Just Checked Into [a location marked by the firstuser as a favorite]; People Who Just Learned Your Language (or otherskill shared with the first user); People You've Just Met/Friended; andetc.

In particular embodiments, the first user may navigate throughuser-cards 430A-C using a touch input detected by touch sensor of mobileclient system 130. As an example and not by way of limitation, the usermay navigate between user-cards 430A-C by swiping upward or pulling downon the title bar or edge of 430A-C depending on how user-cards 430A-Care displayed on mobile client system 130. In particular embodiments,the user may navigate between user-cards 430A-C by swiping left or righton the touch sensor of mobile client system 130. In particularembodiments, the user-card interface 410 may only display one user-cardat a time, and the first user may navigate from each user-card touser-card through a swipe gesture. In particular embodiments, aplurality of user-cards may be displayed simultaneously on the user-cardinterface 410. Although this disclosure describes navigating through thecards using particular touch gestures, this disclosure contemplatesnavigation of the cards through any suitable user input, such as forexample, actuating a button.

In particular embodiments, user-cards 430A-C may correspond to a largenumber of second users 440, such that displaying all of the users withineach user-card would be infeasible. In the example of FIG. 4, eachuser-card 430A-C as displayed in user-card interface 410 may only listone or several users corresponding to the user-card. In particularembodiments, the first user may then interact with user-card 430A-C,which will cause the selected user-card 430A-C to expand on theuser-card interface 410. The user-card 430A-C may display a greaternumber of users than it displayed prior to the interaction. Inparticular embodiments, the first user may then scroll through the listof users displayed within user-card 440.

In particular embodiments, user-cards 430A-C may also containinteractive elements 442. As an example and not by way of limitation,interactive element 442 may be a like button; a button accepting ordenying a friend request; a button to block someone or remove them as afriend; a prompt to write a message on another user's wall; a prompt tosend another user a message; and other various ways to interact withanother user through a social-networking system. In particularembodiments, different user-cards 430A-C may display fewer interactiveelements than the full range of available interactive elements, due tospace limitations in the user-card interface 410. In particularembodiments, each user-card 430A-C may display one or two interactiveelements, which are determined to be the most appropriate for thatuser-card. In the example of FIG. 4, user-card 430A contains other userswho have friend-requested the first user. User-card 430A then displaystwo interactive elements 442, to either confirm the friend request or todeny the friend request. In the example of FIG. 4, user-card 430Bcontains other users whose birthday is the current date. User-card 430Bthen displays an interactive element 442 which enables the first user topost a message on the other users' walls. In particular embodiments,determination of which interactive elements will be displayed on aparticular user-card may be performed by the social-networking system byusage history for that user-card. In particular embodiments, the firstuser may indicate a preference for what interactive elements he or shewould like to be displayed for particular user-cards in user-cardinterface 410.

In particular embodiments, social-networking system 160 may calculate auser-card score for the suggested queries for each user-card. Inparticular embodiments, the user-card score may be used to determine ifthe user-card should be sent to the first user for display. Inparticular embodiments, the user-card score may be used to order theuser-cards for display to the first user. As an example and not by wayof limitation, the user-cards may be ordered as a ranked list based onthe user-card scores. The user-card score may be, for example, aconfidence score, a probability, a quality, a ranking, another suitabletype of score, or any combination thereof. The structured queries may bescored based on a variety of factors, such as, for example, the page ortype of page the user is accessing, user-engagement factors,business-intelligence data, the predicted click-through rate (CTR) ofparticular suggested queries, the conversion-rate of particularsuggested queries, user-preferences of the user, the search history ofthe user, advertising sponsorship of particular queries, the user'ssocial-graph affinity for social-graph elements referenced in particularqueries, the inferred intent of the user, the general or currentpopularity of particular suggested queries, the usefulness of particularsuggested queries, the current geographic location of the user, thecurrent time, other suitable factors, or any combination thereof.Although this disclosure describes scoring user-cards and structuredqueries in a particular manner, this disclosure contemplates scoringstructured queries in any suitable manner. In particular embodiments,social-networking system 160 may determine user-card scores for a firstuser dynamically based on a change in the factors described above. As anexample and not by way of limitation, if user-card scores for a firstuser are calculated at a first geographic location at a first time, andthen at a second time the first user moves to a second geographiclocation, the user-card scores may be re-calculated for the new time andnew location. In particular embodiments, the re-calculation of user-cardscores may occur with no input from the first user.

As described above, user-cards 430A-C corresponding to structuredqueries may be displayed on a user-card interface 410 of a nativeapplication or on a webpage accessed by a browser client on the user'sclient system 130. In particular embodiments, the user-card interface410 may display only user-cards 430A-C previously selected manually bythe user of the mobile client system 130. Furthermore, in particularembodiments, user-cards 430A-C corresponding to structured querieshaving a user-card score above a threshold user-card score may be sentor displayed to the user. The user-cards 430A-C may be ordered or rankedby their user-card scores. More information on structured search queriesand grammar models may be found in U.S. patent application Ser. No.13/556,072, filed 23 Jul. 2012, U.S. patent application Ser. No.13/674,695, filed 12 Nov. 2012, and U.S. patent application Ser. No.13/731,866, filed 31 Dec. 2012, each of which is incorporated byreference.

In particular embodiments, ranking of user-cards 430A-C may be based atleast in part on particular query-domains, query-filters, filter values,or any combination thereof. Herein, reference to a predicted CTR rankingmay refer to a probability that the user will “click through” tointeract with an entity or a user associated with the content of aparticular user-card 430A-C. As an example and not by way of limitation,social-networking system 160 may rank cards 430A-C using a value modeldescribed below. As another example and not by way of limitation,social-networking system 160 may score user-cards 430A-C according toinferring a use case associated with user-card 430A-C, as describedbelow. Although this disclosure describes ranking user-cards in one ormore particular manners, this disclosure contemplates in any suitablemanner.

In particular embodiments, social-networking system 160 may score cards430A-C based at least in part on a value model. As an example and not byway of limitation, the value model of ranking may calculate an overallvalue to social-networking system 160. For example, an activity (e.g.liking a wall post) may have a CTR of 10% and may have an associatedvalue of 1 and another activity (e.g. accepting a friend request) mayhave a CTR of 5% but a value of 100 since accepting a new friend requestmay be determined to make users 100 times happier to do this than like apost. Therefore, user-cards relating to friend requests may be rankedhigher than user-cards only relating to wall posts. In particularembodiments, the value model may be a function of the predicted CTRmultiplied by a predicted conversion rate and multiplied by a value ofthe conversion event.

As another example, the value model of scoring may be based at least inpart on social-networking system 160 calculating the predicted CTR foreach user-card 430A-C. Social-networking system 160 may infer user-cards430A-C corresponding to suggested queries with higher predicted CTRs areof higher interest to the user. For example, social-networking system160 may calculate the predicted CTR based at least in part on factors,such as for example time of day, day of the week, current location ofthe user, CTRs of other users with similar demographic data, acalculated CTR for the user with respect to particularquery-domains/query-filters, social-graph affinity, or any combinationthereof. In particular embodiments, social-networking system 160 maycalculate the predicted CTR for each user-card 430A-C based at least inpart on preferences of the user. As an example and not by way oflimitation, one of more user-preferences may be specified by the user,other users (e.g., parents or employers of the user), systemadministrators, third-party systems 170, or otherwise determined bysocial-networking system 160. More information on calculating predictedCTR for a user-card may be found in U.S. Patent Application No.61/918,431, filed 19 Dec. 2013, which is incorporated by reference.

In particular embodiments, social-networking system 160 may orderuser-cards 430A-C based at least in part on inferring a use caseassociated with each user-card 430A-C. Furthermore, inferring the usecase of the user may be based at least in part on the user history ofthe user or other users with similar demographic information as theuser. In particular embodiments, the inferred intent(s) of the user maycorrespond to particular suggested queries or query-domain/filters, anduser-cards 430A-C corresponding to suggested queries matching theinferred intent of the user may have a higher ranking. In particularembodiments, social-networking system 160 may infer the intent of theuser based on a variety of factors, such as for example, the time ofday, the proximity of the user to other users or objects, social-graphinformation, social-graph affinity, the search history of the user,feedback from the user, the geographic location of the user, otherrelevant information about the user, or any combination thereof. As anexample and not by way of limitation, social-networking system 160 mayinfer the user is interested in finding a restaurant based on the timeof day and information, such as for example user-history, of the user.For example, social-networking system 160 may rank user-cards 430A-Creferencing restaurants more highly at a particular time frame based atleast in part on the user frequently checking-in at restaurants at theparticular time of day. As another example, social-networking system 160may rank particular user-cards 430A-C more highly based on theparticular day of the week and information, such as for exampleuser-history, of the user. For example, social-networking system 160 mayrank user-cards 430A-C referencing [“Movies”] (e.g. “People WatchingMovies Right Now”) more highly on a particular day of the week (e.g.Friday) based at least in part on the user history (e.g. “check-ins”)with respect to movie theaters on the particular day of the week. Moreinformation on determining the intent of a user may be found in U.S.patent application Ser. No. 13/776,469, filed 25 Feb. 2013, which isincorporated by reference. Although this disclosure describes inferringthe intent of a user in a particular manner, this disclosurecontemplates inferring the intent of the user in any suitable manner.

In particular embodiments, social-networking system 160 may scoreuser-cards for the first user that will have a future relevance for thefirst user. As an example and not by way of limitation,social-networking system 160 may receive information relating to thefirst user travelling to Boston, Mass., in three weeks. User-cardsrelating to Boston may not be immediately relevant to the first user. Asthe trip to Boston nears, user-cards relating to Boston, such as “PeopleYou May Know in Boston”, “People From Boston” (i.e. people with Bostonas their hometown), “People Travelling to Boston At the Same Time asYou”, etc. may have increased user-card scores even before the firstuser departs for Boston, so that they may find out about second usersassociated with Boston before departure instead of only learning aboutthese users once the first user is in Boston. In this way, the firstuser could plan to meet with second users in Boston, or ask users aboutvisiting Boston ahead of time.

In particular embodiments, the second users comprising each user-card430A-C may also be scored and ordered for presentation. In particularembodiments, ordering of the second users referenced in each user-card430A-C may take the form of a ranked list. In particular embodiments, auser-card 430A-C may contain more references 440 to second users thancan be effectively displayed in the user-card interface 410. This may bedue to the size of the display area 400 of mobile client system 130, ordue to the limited size of each user-card 430A-C in user-card interface410. In particular embodiments, each second user referenced in aparticular user-card 430A-C may be associated with a user-score. Theuser-score may be an indication of how relevant having that particularsecond user in that particular user-card will be to the first user. Inparticular embodiments, the user-score may be based at least in part onthe social-graph affinity of the first user with respect to the seconduser. In particular embodiments, the user-score may be calculated usingthe affinity coefficient of the first user with respect to the seconduser. In particular embodiments, the user-score may be calculated basedon the affinity coefficient of a node corresponding to the structuredquery of the user-card 430A-C with respect to the second user.

In particular embodiments, only second users who are above a thresholduser-score for the particular user-card 430A-C may be referenced withina user-card. In particular embodiments, the references 440 for thesecond users in user-card 430A-C may be further ranked based on theuser-scores of each second user for the particular user-card 430A-C. Asan example and not by way of limitation, for a user-card 430A-C that isdisplayed on user-card interface 410 with the capability of displayingtwo sets of references 440 to two second users, the social-networkingsystem 160 may calculate user-scores for all second users referenced byuser-card 430A-C, and choose the two second users with the highestuser-score for the particular user-card. The references 440 for thechosen two second users would be displayed in user-card 430A-C, with thereference 440 for the higher-scoring second user being listed first. Ifthe first user then interacts with user-card 430A-C, the user-card mayshow an expanded list of references 440 to second users, with thereference 440 to the second user with the third-highest user-scorelisted below the references 440 for the first two second users.

FIG. 5 illustrates an example method 500 for generating user-cards for afirst user of mobile client system 130. The method may begin at step510, where social-networking system 160 may access a social graph 200comprising a plurality of nodes and a plurality of edges 206 connectingthe nodes. The nodes may comprise a first user node 202 and a pluralityof second nodes (one or more user nodes 202, concepts nodes 204, or anycombination thereof). At step 515, social-networking system 160 mayreceive a request from a first user of the social-networking system 160for a list of users. In particular embodiments, the request in step 515may be an express request to view user-cards. In particular embodiments,social-networking system 160 may interpret a first user's request as arequest for user-cards. At step 520, social-networking system 160 maygenerate a plurality of user-cards. The user-cards may be generatedbased on contemporaneous input of the first user, past inputs of thefirst user, or generated automatically by the social-networking systembased on associations of the first user with particular nodes and edgesof the social graph. In particular embodiments, each user-card mayinclude a structured query that references a query-domain associatedwith the online social network and zero or more query-filters. Eachquery-filter may reference one or more nodes of the plurality of nodesor one or more edges of the plurality of edges. At step 530,social-networking system 160 may calculate a user-card score for eachuser-card based on one or more user-card factors. At step 540,social-networking system 160 may determine if the user-card score foreach user-card exceeds a threshold user-card score. At step 550,social-networking system 160 may send each user-card having a user-cardscore greater than a user-card threshold score to the first user fordisplay on a page currently accessed by the first user.

Particular embodiments may repeat one or more steps of the method ofFIG. 5, where appropriate. Although this disclosure describes andillustrates particular steps of the method of FIG. 5 as occurring in aparticular order, this disclosure contemplates any suitable steps of themethod of FIG. 5 occurring in any suitable order. Moreover, althoughthis disclosure describes and illustrates an example method forgenerating cards for the user including the particular steps of themethod of FIG. 5, this disclosure contemplates any suitable method forgenerating cards for the user including any suitable steps, which mayinclude all, some, or none of the steps of the method of FIG. 5, whereappropriate. Furthermore, although this disclosure describes andillustrates particular components, devices, or systems carrying outparticular steps of the method of FIG. 5, this disclosure contemplatesany suitable combination of any suitable components, devices, or systemscarrying out any suitable steps of the method of FIG. 5.

FIG. 6 illustrates an example method 600 for ordering user-cards basedon a user-card score. The method may begin at step 610, wheresocial-networking system 160 may access a social graph 200 comprising aplurality of nodes and a plurality of edges 206 connecting the nodes.The nodes may comprise a first user node 202 and a plurality of secondnodes (one or more user nodes 202, concept nodes 204, or any combinationthereof). At step 615, social-networking system 160 may receive arequest from a first user of the online social network for a list ofusers. In particular embodiments, the request in step 515 may be anexpress request to view user-cards. In particular embodiments,social-networking system 160 may interpret a first user's request as arequest for user-cards. At step 620, social-networking system 160 maygenerate a user-card group that includes a number of user-cards. Inparticular embodiments, each user-card corresponds to a suggested querythat references a query-domain associated with the online social networkand zero or more query-filters. In particular embodiments, eachquery-filter references one or more nodes or one or more edges. At step630, social-networking system 160 may calculate a predicted user-cardscore for each user-card in the user-card group based on one or moreuser-relevance factors. At step 640, social-networking system 160 mayrank each of the user-cards in the user-card group based on thepredicted user-card score. At step 650, social-networking system 160 maysend the user-card group to the first user for display on a pagecurrently accessed by the first user. In particular embodiments, theuser-cards of the user-card group may be ordered based on the rankingassociated with the user-cards.

Particular embodiments may repeat one or more steps of the method ofFIG. 6, where appropriate. Although this disclosure describes andillustrates particular steps of the method of FIG. 6 as occurring in aparticular order, this disclosure contemplates any suitable steps of themethod of FIG. 6 occurring in any suitable order. Moreover, althoughthis disclosure describes and illustrates an example method for rankingcards including the particular steps of the method of FIG. 6, thisdisclosure contemplates any suitable method for ranking cards includingany suitable steps, which may include all, some, or none of the steps ofthe method of FIG. 6, where appropriate. Furthermore, although thisdisclosure describes and illustrates particular components, devices, orsystems carrying out particular steps of the method of FIG. 6, thisdisclosure contemplates any suitable combination of any suitablecomponents, devices, or systems carrying out any suitable steps of themethod of FIG. 6.

FIG. 7 illustrates an example method 700 for determining one or moresecond users to be referenced in a particular user-card, and forordering references 440 to one or more second users. In particularembodiments, ordering of references 440 may comprise a ranked list ofreferences to each second user. The method may begin at step 710, wheresocial-networking system 160 may access a social graph 200 comprising aplurality of nodes and a plurality of edges 206 connecting the nodes.The nodes may comprise a first user node 202 and a plurality of secondnodes (one or more user nodes 202, concept nodes 204, or any combinationthereof). At step 715, social-networking system 160 may receive arequest from a first user of the social-networking system 160 for a listof users. In particular embodiments, the request in step 515 may be anexpress request to view user-cards. In particular embodiments,social-networking system 160 may interpret a first user's request as arequest for user-cards. At step 720, social-networking system 160 maygenerate a list of references to one or more second users correspondingto the structured query for a user-card. In particular embodiments, thelist of one or more second users may include second users who are notassociated with a user node 202 on the social graph 200, but arecontacts of the first user outside of the social graph. As an exampleand not by way of limitation, second users may be users who call or arecalled by the first user via telephonic capabilities of mobile clientsystem 130; send messages and emails through the mobile client system130 through third-party applications and web browser interfaces; or havebeen recorded by third-party applications or by the mobile client system130 as having been in close geographic proximity to the first user. Atstep 730, social-networking system 160 may calculate a user-score foreach of the one or more second users of the list generated in step 720.In particular embodiments, the user-score may be calculated based on thesocial-graph affinity for the first user with respect to a particularsecond user. In particular embodiments, the user-score may be calculatedbased on an affinity of the second user for the one or more nodesreferenced in the structured query corresponding to the user-card. Inparticular embodiments, the user-score may be calculated based on howwell a particular second user matches the structured query of theuser-card. Additional bases for calculating a user-score may be used. Asan example and not by way of limitation, user-scores may be calculatedbased on social interactions of the first user and second user throughthe social-networking system or through other means of socialinteraction (e.g. phone calls, emails, person-to-person interactions,etc.). This allows users not maintaining a presence on thesocial-networking system 160 to be scored. In particular embodiments,social-networking system 160 may generate a composite user-score byweighting the user-score components based on the social graph 200 by aweighting factor and combine it with a user-score component based onsocial activities not on the social graph 200 which is weighted byanother weighting factor. At step 740, social-networking system 160 maydetermine if each second user has a user-score exceeding a thresholduser-score for the particular user-card 430A-C. At step 750,social-networking system 160 may generate a list of references 440 tosecond users comprising the user-card having user-scores that exceed thethreshold user-score. At step 760, social-networking system 160 may rankthe one or more references 440 to second users by their user-scores, andonly include the top-ranked references 440 in user-card 430A-C. As anexample and not by way of limitation, social-networking system 160 mayonly include the references 440 for the ten second users with thehighest user-scores in user-card 430C. At step 770, social-networkingsystem 160 may send the list of references 440 of the second users tothe first user for display within the particular user-card 430A-C. Inparticular embodiments, the list of references 440 sent to the firstuser may be sent as a ranked list based on the user-scores of the secondusers.

Particular embodiments may repeat one or more steps of the method ofFIG. 7, where appropriate. Although this disclosure describes andillustrates particular steps of the method of FIG. 7 as occurring in aparticular order, this disclosure contemplates any suitable steps of themethod of FIG. 7 occurring in any suitable order. Moreover, althoughthis disclosure describes and illustrates an example method for rankingcards including the particular steps of the method of FIG. 7, thisdisclosure contemplates any suitable method for ranking cards includingany suitable steps, which may include all, some, or none of the steps ofthe method of FIG. 7, where appropriate. Furthermore, although thisdisclosure describes and illustrates particular components, devices, orsystems carrying out particular steps of the method of FIG. 7, thisdisclosure contemplates any suitable combination of any suitablecomponents, devices, or systems carrying out any suitable steps of themethod of FIG. 7.

FIG. 8 illustrates an example of focused queries in user-card interface410. The social-networking system 160 may determine one or morequery-filters that are applicable to user-card 430A-C, based on theoriginal structured query associated with user-card 430A-C and thecorresponding nodes in the social graph 200. In particular embodiments,the first user may select an interactive element 414 that will display aplurality of filter options to the first user. In particularembodiments, the user-card interface 410 may display defaultquery-filters 450 to the first user based on the currently displayed oneor more user-cards 430A-C. In particular embodiments, the first user mayselect in advance one or more query filters that he or she wishes to seein user-card interface 410. In particular embodiments, the first usermay add query-filters through a text query. The social-networking system160 then translates the text query input by the first user into a newstructured query. In particular embodiments, social-networking system160 may determine one or more other nodes that are not referenced in theoriginal structured query of user-card 430A-C, and generate aquery-filter 450 that includes references to those other nodes of thesocial graph 200. In particular embodiments, the query-filter may thengenerate a new user-card 430A-C that includes references to those othernodes of social graph 200 as well as the nodes associated in theoriginal structured query. As an example and not by way of limitation,in FIG. 4, user-card 430B lists second users having a birthday thatmatches the current date. A first user may select a query-filter basedon geographic location. User-card 430B may be updated to read “BirthdaysToday in Palo Alto, Calif.” The second users comprising user-card 430Bwill be updated with the new query. In particular embodiments, theuser-card score and the user-score for the user-card 430A-C and the oneor more second users comprising the user-card 430A-C may bere-calculated following the example methods illustrated in FIG. 6 andFIG. 7, and the user-card interface 410 may be updated to display theuser-cards 430A-C and second users 440 as ranked using the re-calculatedscores.

In particular embodiments, in response to a query-filter being appliedto one user-card 430A-C, social-networking system 160 may apply the samequery-filter to other user-cards 430A-C. As an example and not by way oflimitation, social-networking system 160 may determine that the firstuser is interested in the query-filter that she has applied, and thatshe would prefer to see other user-cards with the same query-filter,without having to apply the query-filter separately for each user-card430A-C.

FIG. 9 illustrates an example of different user-interactions being madeavailable to the user for each user-card 430C-E. In the example of FIG.9, for user-card 430C (“Life Events”), the users being displayed in theuser-card may have had some recent life experience of some personalimportance. In particular embodiments, the user of mobile client system130 may be presented with options to “Like” the new life event, andfurther may be able to write to that user's wall. Further in the exampleof FIG. 9, user-card 430D (“People Who Are Hungry”) may displayreferences to second users who correspond to a structured query for“hunger.” As an example and not by way of limitation, social-networkingsystem 160 may use the inferred intent of one or more second users todetermine if they are hungry and should be placed in user-card 430D. Inparticular embodiments, the user may then contact one or more secondusers referenced in user-card 430D, for example to see if they wouldlike to meet up for a meal. In the example of FIG. 9, user-card 430E(“People You May Know”) may list references to second users ofsocial-networking system 160 who are not “friends” of the first user,but are users whom the social-networking system 160 believes may knowthe first user. The second users referenced in user-card 430E could be,as an example and not by way of limitation, friends of friends of thefirst user, classmates or work colleagues of the first user, or may bepresent at the same events and locations as the first user at the sametime. The first user may be presented with the option to friend requestthe referenced second users in user-card 430E.

In particular embodiments, the first user may have the option ofindicating that they too have an affinity for a particular user-card. Inthe example of FIG. 9, the first user may see user-card 430D which showssecond users who are hungry as recorded by social-networking system 160.The first user may select an interactive element 442 which is labeled“me too,” allowing the first user to indicate to social-networkingsystem 160 that he too is hungry. This may enable the first user to beassociated with the concept node for hunger without reference to anyother actions of the first user which may indicate an association withhunger. In particular embodiments, this may add the first user to thelist of users that are viewable by other users also viewing a similaruser-card to user-card 430D. As an example and not by way of limitation,while the first user is viewing user-card 430D, a third user may also beviewing a similar user-card which contains the same list of second usersas user-card 430D, but does not contain the first user in the list.Then, if the first user selects the “Me Too” button for user-card 430D,then the user-card viewed by the third user may be updated to includethe first user in the list of second users. The third user may thencontact the first user to arrange a meal together.

In particular embodiments, selecting an interactive element 442indicating a “Me Too” status for a particular user-card may also affectthe user-card score for that particular user-card. In particularembodiments, the user-card score may be based at least in part on theaffinity of the first user with respect to the nodes 202, 204 and edges206 referenced in the structured query for the user-card 430A-C. Byselecting the “Me Too” button, the first user may increase his affinitywith respect to the referenced nodes and edges, and thereby increase theuser-card score for the particular user-card. In particular embodiments,all of the user-cards 430A-C displayed in user-card interface 410 may beupdated with new user-card scores based on the new associations betweenthe first user and the social graph based on the selection of the “MeToo” button. As an example and not by way of limitation, a first usermay have on her user-card interface 410 two user-cards for “Watching aMovie Right Now,” and “Jogging Right Now.” If the first user selects the“Me Too” button for “Jogging Right Now,” the user-card score of thatuser-card may increase, while the user-card score for “Watching a MovieRight Now” user-card may decrease, since the first user is likely moreinterested in other users who are jogging at the same time as her, andless interested in other users who are most likely not jogging at thattime.

In particular embodiments, the selection of a “Me Too” button for aparticular user-card may also affect the user-score for one or moresecond users with respect to the first user. In particular embodiments,in response to the selection of a “Me Too” button, social-networkingsystem 160 may re-calculate user-scores for one or more second users inthat same user-card. As an example and not by way of limitation, a firstuser may be presented with a user-card 430D indicating “People Who AreHungry.” The current ranking of second users in user-card 430D may bebased on a user-score that weights the social affinity of each seconduser to the first user as a higher factor than geographic proximity ofthe second user to the first user. In that case, user-card 430D maydisplay at the top of the user-card second users who are hungry, andcloser friends to the first user. However, once the first user selectsthe “Me Too” button for user-card 430D, the calculation of user-scoresfor user-card 430D may be changed. It may be more important for thefirst user to know who else is hungry around him, rather than which ofhis closest friends are also hungry. Therefore, user-scores for secondusers in user-card 430D may be recalculated with a greater user-scoreweight being given to geographic proximity. The first user may then seean updated user-card 430D after his selection of the “Me Too” button,where the second users displayed at the top of user-card 430D are thehungry people close to him. In particular embodiments, selection of the“Me Too” button may result in re-calculation of user-scores in otheruser-cards 430A-C in addition to the selected user-card.

In particular embodiments, the first user may also have the option todelete particular user-cards from the user-card interface 410. In theexample of FIG. 9, each user-card 430C-E displays an interactive element442 represented as an “X” button in the upper-right corner. If the userwishes to remove a particular user-card from the user-card interface 410(for example if the user is never interested in seeing who is hungry atthe moment), the user may select the “X” button to remove the user-cardfrom display, as shown in FIG. 10. In the example of FIG. 10, user-card430D has been removed from user-card interface 410, and user-card 430Ehas been moved up in the view of user-card interface 410 to be directlybelow user-card 430C. A new user-card 430F (“People Travelling NearYou”) is now present on the display of user-card interface 410.

In particular embodiments, social-networking system 160 may use thefirst user's interactions with user-cards 430A-C to improve dynamicgeneration of user-cards for display to the first user. As an exampleand not by way of limitation, each time that the first user interactswith a user-card 430A-C, the user-card score for that user-card may beincreased, so that the user-cards that the first user interacts withmore frequently will appear at the top of the list of user-cards. Asanother example, a first user may only view a particular user-card atcertain times, certain geographic locations, or when social-networkingsystem 160 detects that he is with a certain other person.Social-networking system 160 may then increase the user-card score forthat user-card when those conditions are met, so that the next time theuser views user-card interface 410 under the same conditions, the sameuser-card is displayed higher on the user-card interface 410 than it isdisplayed when those conditions are not met. In particular embodiments,a first user may consistently apply a particular query-filter for auser-card. Social-networking system 160 may eventually decide to displaya user-card to the first user already having the query-filter, insteadof the original user-card. As an example and not by way of limitation, afirst user may frequently interact with a user-card for “Jogging RightNow,” and always apply an additional filter for “Show Only FacebookFriends.” Social-networking system 160 may eventually replace the“Jogging Right Now” user-card with a “Facebook Friends Jogging RightNow” user-card for display on user-card interface 410, saving the firstuser the time of applying the same query-filter once again. The firstuser may be asked if she would like to make the change permanent, or theuser-card interface 410 may update the user-card automatically.

Implicit Contacts

In particular embodiments, social-networking system 160 may generate,for a first user, a user-list comprised of all second users that may bereferenced in user-cards of the first user. Limiting user-cards tocontain only second users who are in the user-list may be helpful, asthe second users on the user-list may be the second users that thesocial-networking system 160 determines the first user knows or shouldknow. This ensures that when the first user is browsing user-cards, thefirst user will only see second users that the first user actuallyknows, and thus the first user may be more interested in seeing thosesecond users rather than other users that social-networking system 160has determined is not known to the first user. As an example and not byway of limitation, social-networking system 160 may maintain a user-listfor each first user; then, when social-networking system 160 receives arequest from the first user to view user-cards, it may generateuser-cards and determine second users to fill each user-card using onlythe second users listed in the user-list, instead of determininguser-scores for any additional users. In particular embodiments, auser-list may be comprised of the first user's friends onsocial-networking system 160; friends-of-friends of the first user (e.g.indirect connections to the first user); and users who have interactedwith the first user through third-party APIs on social-networking system160 (as an example, a second user who is not friends with the first useron the social-networking system, but has played a social game togetherthrough the social-networking system). In particular embodiments,social-networking system 160 may add second users who have been invitedto the same events as the first user, or have attended the same eventsas the first user. In particular embodiments, social-networking system160 may add second users who have interacted with the first user usingthird-party applications. As an example and not by way of limitation,social-networking system 160 may add second users who have interactedwith the first user through applications like Twitter, Instagram, orSkype. In particular embodiments, social-networking system 160 mayreceive information about second users from the first user's mobileclient system 130. As an example and not by way of limitation, thesocial-networking system 160 may gain access to an address book of thefirst user. This would allow social-networking system 160 to add to theuser-list second users who are contacts of the first user outside of thesocial-networking system. The social-networking system 160 may addsecond users who have called the first user or been called by the firstuser; second users who have sent or received e-mail, short messageservice (SMS), or instant messaging (IM) messages; and second users whoare listed in address books associated with the first user. As anexample and not by way of limitation, second users listed on a firstuser's phone book, Gmail address book, or Outlook address book may beadded to a user-list. In particular embodiments, social-networkingsystem 160 may receive information relating to location data for thefirst user at particular points in time, and add second users who havefrequently been at the same geographic location at the same time as thefirst user. In particular embodiments, for a second user who is a userof social-networking system 160, interactions between the first user andthe second user described above may be represented in social graph 200between a user node 202 associated with the first user, and another usernode 202 associated with the second user. In particular embodiments,where a second user is not a user of social-networking system 160,social-networking system 160 may generate a new node in social graph 200(e.g., a user node 202 or a concept node 204) to represent the seconduser. The social-networking system 160 may then represent interactionsbetween the first user and the second user in a similar manner describedabove for a second user who is a user of social-networking system 160.

In particular embodiments, social-networking system 160 may useinformation associating the first user with the second user (or viceversa) which is known to social-networking system 160, but is notvisible to the first user, the second user, or both. This may be due toprivacy settings of the first user or the second user which prevents theassociation information from being sent to the other user. As an exampleand not by way of limitation, a first user may have indicated on herprofile page on the social-networking system 160 that she works at theStrand Book Store. A particular second user, who has a profile page onsocial-networking system 160 but is not a friend of the first user onsocial-networking system 160, may have posted on his wall that hefrequently goes to the Strand Book Store. The second user may have sethis privacy settings so that the first user is not able to view hisprofile. Social-networking system 160 may still be able to use these twopieces of data in calculating a contact-score, determine that thecontact-score exceeds the threshold contact-score, indicating that thefirst user likely knows the second user, and add the second user to thefirst user's user-list. The first user may indeed know the second userbecause they have interacted at the book store; however, the first usermay still not be able to view the second user's post about going to thebook store. As another example and not by way of limitation, theaffinity of a first user with respect to a second user may be defined asthe presence of the second user in the first user's list of contacts.Then, if the first user searched for the second user in thesocial-networking system, the second user may be placed in the user-listof the first user. However, the second user would not be notified thathe or she has been placed in the user-list of the first user, and wouldnot have access to information regarding the action that caused thesecond user to be placed on the first user's user-list (e.g. the firstuser's action of searching for the second user). In particularembodiments, a second user would not be able to directly influence theuser-list of the first user, unless the second user altered their ownprofile information; e.g. changed their name or deactivated theiraccount. More information about using privacy settings to determinevisibility of interactions to another user may be found in U.S. patentapplication Ser. No. 13/556,017, filed 23 Jul. 2012, which isincorporated by reference.

In particular embodiments, social-networking system 160 may calculatecontact-scores for each second user with respect to the first user. Thecontact-score may be based on a calculated social-graph affinity of thefirst user with respect to the second user. In particular embodiments,other interactions between the first user and the second user that mayoccur through the social-networking system or through other means ofinteraction as described above may be used to calculate thecontact-score. In particular embodiments, social-networking system 160may compare the contact-score of each second user to a thresholdcontact-score. The social-networking system 160 may then only add to theuser-list second users associated with contact-scores that exceed thethreshold contact-score.

In particular embodiments, social-networking system 160 may generate anew user-list every time the first user accesses the social-networkingsystem or requests to view one or more user-cards. In particularembodiments, the social-networking system 160 may store the user-listand the contact-scores associated with each second user of the user-listin a data store of social-networking system 160, and update theuser-list each time it detects the first user's activities on mobileclient system 130. For example, social-networking system 160 mayconsider adding second users when the first user calls a particular userfor the first time, or sends a message to a particular user for thefirst time. In particular embodiments, social-networking system 160 mayupdate the user-list for a first user at particular time intervals. Thetime interval for updating a user-list may be set automatically by thesocial-networking system 160 based on the frequency of the first user'sactivities. In particular embodiments, the first user may be given theoption to determine how often the user-list is updated.

The first user of mobile client system 130 may be interested in seeingthe user-list which has been generated for the first user. In particularembodiments, social-networking system 160 may send a user-listcomprising all second users who may be included in user-cards for thefirst user as the list of contacts for the first user. In particularembodiments, social-networking system 160 may present an address book ofcontacts to the first user comprising friends of the first user on thesocial-networking system, and additionally contacts stored on mobileclient system 130. In particular embodiments, the user-list may indicateto the first user the second users who are already friends with thefirst user on the social-networking system 160, and second users who arenot friends of the first user. The first user may have the option ofremoving friends or requesting new friends depending on the currentstatus of a second user on the user-list. In particular embodiments, thefirst user may remove a second user from the user-list completely. Inparticular embodiments, the first user may use query-filters asdescribed above to see a subset of second users of the user-listcorresponding to the particular query-filter.

FIG. 11 illustrates an example user-list of contacts of the first useras determined by the social-networking system 160. The social-networkingsystem 160 may access the social graph 200, and generate a list ofsecond users 440 that have any association with the first user. Theassociation may take place through the social-networking system 160, ormay be through other means of interaction where the interaction has beenrecorded by social-networking system 160. Social-networking system 160may calculate a contact score for each second user 440, and remove anysecond users 440 whose contact-scores are below a thresholdcontact-score. In response to a request by the first user to view theuser-list 413, social-networking system 160 may send to the first userthe user-list comprising second users 440. The second users 440 may beassociated with interactive elements 442 based on the type ofassociation between the first user and the particular second user. Inparticular embodiments, other interactive elements 444 may allow thefirst user to remove particular second users from the displayeduser-list 413. In particular embodiments, the user-list may also displayan interactive element 414 wherein the first user may filter theuser-list based on additional criteria or query-filters.

Although the example of FIG. 11 displays contacts sorted in alphabeticalorder, this invention contemplates any method of arranging contacts,including, as examples and not by way of limitation, theircontact-score; chronological (or reverse-chronological) order by thelast time the first user interacted with the particular user; relevanceof each particular user to the first user as calculated by thesocial-networking system 160; or by geographical proximity to the firstuser.

FIG. 12 illustrates an example method 1200 for updating a user-list. Themethod may begin at step 1210, where social-networking system 160 mayaccess a social graph 200 comprising a plurality of nodes and aplurality of edges 206 connecting the nodes. The nodes may comprise afirst user node 202 and a plurality of second nodes (one or more usernodes 202, concepts nodes 204, or any combination thereof). At step1220, social-networking system 160 may receive information associatingthe first user with one or more other users. The association informationmay comprise interactions between the first user and the one or moresecond users through social-networking system 160, or interactionsbetween the first user and the one or more second users through othermeans wherein the interactions are recorded by social-networking system160. At step 1230, social-networking system 160 may determine if the oneor more second users are currently on the user-list for the first user.At step 1235, if the second user is already on the user-list, thensocial-networking system 160 may update the second user's contact-score.At step 1240, if the second user is not on the user-list,social-networking system 160 may calculate a contact-score for thesecond user, based at least in part on the association informationreceived in step 1220. At step 1250, the social-networking system 160may compare the contact-score of the second user to a thresholdcontact-score. At step 1260, if the contact-score of the second user isat least greater than the threshold contact-score, then the second useris added to the user-list. At step 1265, if the contact-score of thesecond user is not greater than the threshold contact-score, then thesecond user is not added to the user-list.

Particular embodiments may repeat one or more steps of the method ofFIG. 12, where appropriate. Although this disclosure describes andillustrates particular steps of the method of FIG. 12 as occurring in aparticular order, this disclosure contemplates any suitable steps of themethod of FIG. 12 occurring in any suitable order. Moreover, althoughthis disclosure describes and illustrates an example method forgenerating cards for the user including the particular steps of themethod of FIG. 12, this disclosure contemplates any suitable method forgenerating cards for the user including any suitable steps, which mayinclude all, some, or none of the steps of the method of FIG. 12, whereappropriate. Furthermore, although this disclosure describes andillustrates particular components, devices, or systems carrying outparticular steps of the method of FIG. 12, this disclosure contemplatesany suitable combination of any suitable components, devices, or systemscarrying out any suitable steps of the method of FIG. 12.

In particular embodiments, the first user may select a “recent” optionfor the user-list 413 and user-card interface 410. With this optionselected, social-networking system 160 may calculate user-scores andcontact-scores for second users using a time-decaying social affinity ofthe first user with respect to the second user. In particularembodiments, the first user may also select a “less recent” option forthe user-list 413 which specifies a time period prior to the time periodspecified for the “recent” option. The social affinity may be weightedwith a time-decay which favors the specified time period. As an exampleand not by way of limitation, a particular second user may have been ina class together with the first user the previous semester, but is notcurrently in the same class as the first user. Thus, although the numberof interactions between the first and second users is fairly high, ifthe first user selects the “recent” option, the second user'scontact-score or user-score will be less than it would have been duringthe previous semester, and the second user may not appear on a user-listunder the “recent” option. In the same example, if the first userselects the “less recent” option, the contact-score or user-score of theparticular second user may be increased, or decreased by a smallerfactor than with selection of the “recent” option. Under the “lessrecent” option, the second user may appear on the user-list, unlike the“recent” option.

In particular embodiments, selection of “recent” or “less recent”options may update user-cards 430A-C as an additional query-filterapplied to the user-cards. As an example and not by way of limitation, afirst user may select the “recent” option, and a user-card 430A-Ccurrently displaying results for “People You Have Been PhotographedWith” may be updated to display “People You Have Been Photographed WithRecently.” Alternatively, in an example where the first user selects the“less recent” option, user-card 430A-C may be updated to display “PeopleYou Were Photographed With Last Month.”

FIG. 13 illustrates an example user-list of second users having recentinteractions with the first user. An interactive element 414 forfiltering the user-list may be selected and a query-filter applied touser-list 413 to show only second users with a recent interaction withthe first user that is viewable by the first user. Second users 440being displayed in the example of FIG. 13 may contain informationdescribing recent interactions between the first user and the seconduser. In particular embodiments, the first user may select one of thesecond users 440 in order to view additional information about thatparticular second user, or to interact with that particular second userthrough the social-networking system 160. The first user may applyadditional query-filters to the “recent” user-list 413 to narrow thelist of second users 440 further.

Social Graph Affinity and Coefficient

In particular embodiments, social-networking system 160 may determinethe social-graph affinity (which may be referred to herein as“affinity”) of various social-graph entities for each other. Affinitymay represent the strength of a relationship or level of interestbetween particular objects associated with the online social network,such as users, concepts, content, actions, advertisements, other objectsassociated with the online social network, or any suitable combinationthereof. Affinity may also be determined with respect to objectsassociated with third-party systems 170 or other suitable systems. Anoverall affinity for a social-graph entity for each user, subjectmatter, or type of content may be established. The overall affinity maychange based on continued monitoring of the actions or relationshipsassociated with the social-graph entity. Although this disclosuredescribes determining particular affinities in a particular manner, thisdisclosure contemplates determining any suitable affinities in anysuitable manner.

In particular embodiments, social-networking system 160 may measure orquantify social-graph affinity using an affinity coefficient (which maybe referred to herein as “coefficient”). The coefficient may representor quantify the strength of a relationship between particular objectsassociated with the online social network. The coefficient may alsorepresent a probability or function that measures a predictedprobability that a user will perform a particular action based on theuser's interest in the action. In this way, a user's future actions maybe predicted based on the user's prior actions, where the coefficientmay be calculated at least in part a the history of the user's actions.Coefficients may be used to predict any number of actions, which may bewithin or outside of the online social network. As an example and not byway of limitation, these actions may include various types ofcommunications, such as sending messages, posting content, or commentingon content; various types of observation actions, such as accessing orviewing profile pages, media, or other suitable content; various typesof coincidence information about two or more social-graph entities, suchas being in the same group, tagged in the same photograph, checked-in atthe same location, or attending the same event; or other suitableactions. Although this disclosure describes measuring affinity in aparticular manner, this disclosure contemplates measuring affinity inany suitable manner.

In particular embodiments, social-networking system 160 may use avariety of factors to calculate a coefficient. These factors mayinclude, for example, user actions, types of relationships betweenobjects, location information, other suitable factors, or anycombination thereof. In particular embodiments, different factors may beweighted differently when calculating the coefficient. The weights foreach factor may be static or the weights may change according to, forexample, the user, the type of relationship, the type of action, theuser's location, and so forth. Ratings for the factors may be combinedaccording to their weights to determine an overall coefficient for theuser. As an example and not by way of limitation, particular useractions may be assigned both a rating and a weight while a relationshipassociated with the particular user action is assigned a rating and acorrelating weight (e.g., so the weights total 100%). To calculate thecoefficient of a user towards a particular object, the rating assignedto the user's actions may comprise, for example, 60% of the overallcoefficient, while the relationship between the user and the object maycomprise 40% of the overall coefficient. In particular embodiments, thesocial-networking system 160 may consider a variety of variables whendetermining weights for various factors used to calculate a coefficient,such as, for example, the time since information was accessed, decayfactors, frequency of access, relationship to information orrelationship to the object about which information was accessed,relationship to social-graph entities connected to the object, short- orlong-term averages of user actions, user feedback, other suitablevariables, or any combination thereof. As an example and not by way oflimitation, a coefficient may include a decay factor that causes thestrength of the signal provided by particular actions to decay withtime, such that more recent actions are more relevant when calculatingthe coefficient. The ratings and weights may be continuously updatedbased on continued tracking of the actions upon which the coefficient isbased. Any type of process or algorithm may be employed for assigning,combining, averaging, and so forth the ratings for each factor and theweights assigned to the factors. In particular embodiments,social-networking system 160 may determine coefficients usingmachine-learning algorithms trained on historical actions and past userresponses, or data farmed from users by exposing them to various optionsand measuring responses. Although this disclosure describes calculatingcoefficients in a particular manner, this disclosure contemplatescalculating coefficients in any suitable manner.

In particular embodiments, social-networking system 160 may calculate acoefficient based on a user's actions. Social-networking system 160 maymonitor such actions on the online social network, on a third-partysystem 170, on other suitable systems, or any combination thereof. Anysuitable type of user actions may be tracked or monitored. Typical useractions include viewing profile pages, creating or posting content,interacting with content, joining groups, listing and confirmingattendance at events, checking-in at locations, liking particular pages,creating pages, and performing other tasks that facilitate socialaction. In particular embodiments, social-networking system 160 maycalculate a coefficient based on the user's actions with particulartypes of content. The content may be associated with the online socialnetwork, a third-party system 170, or another suitable system. Thecontent may include users, profile pages, posts, news stories,headlines, instant messages, chat room conversations, emails,advertisements, pictures, video, music, other suitable objects, or anycombination thereof. Social-networking system 160 may analyze a user'sactions to determine whether one or more of the actions indicate anaffinity for subject matter, content, other users, and so forth. As anexample and not by way of limitation, if a user may make frequentlyposts content related to “coffee” or variants thereof, social-networkingsystem 160 may determine the user has a high coefficient with respect tothe concept “coffee”. Particular actions or types of actions may beassigned a higher weight and/or rating than other actions, which mayaffect the overall calculated coefficient. As an example and not by wayof limitation, if a first user emails a second user, the weight or therating for the action may be higher than if the first user simply viewsthe user-profile page for the second user.

In particular embodiments, social-networking system 160 may calculate acoefficient based on the type of relationship between particularobjects. Referencing the social graph 200, social-networking system 160may analyze the number and/or type of edges 206 connecting particularuser nodes 202 and concept nodes 204 when calculating a coefficient. Asan example and not by way of limitation, user nodes 202 that areconnected by a spouse-type edge (representing that the two users aremarried) may be assigned a higher coefficient than a user nodes 202 thatare connected by a friend-type edge. In other words, depending upon theweights assigned to the actions and relationships for the particularuser, the overall affinity may be determined to be higher for contentabout the user's spouse than for content about the user's friend. Inparticular embodiments, the relationships a user has with another objectmay affect the weights and/or the ratings of the user's actions withrespect to calculating the coefficient for that object. As an exampleand not by way of limitation, if a user is tagged in first photo, butmerely likes a second photo, social-networking system 160 may determinethat the user has a higher coefficient with respect to the first photothan the second photo because having a tagged-in-type relationship withcontent may be assigned a higher weight and/or rating than having alike-type relationship with content. In particular embodiments,social-networking system 160 may calculate a coefficient for a firstuser based on the relationship one or more second users have with aparticular object. In other words, the connections and coefficientsother users have with an object may affect the first user's coefficientfor the object. As an example and not by way of limitation, if a firstuser is connected to or has a high coefficient for one or more secondusers, and those second users are connected to or have a highcoefficient for a particular object, social-networking system 160 maydetermine that the first user should also have a relatively highcoefficient for the particular object. In particular embodiments, thecoefficient may be based on the degree of separation between particularobjects. The lower coefficient may represent the decreasing likelihoodthat the first user will share an interest in content objects of theuser that is indirectly connected to the first user in the social graph200. As an example and not by way of limitation, social-graph entitiesthat are closer in the social graph 200 (i.e., fewer degrees ofseparation) may have a higher coefficient than entities that are furtherapart in the social graph 200.

In particular embodiments, social-networking system 160 may calculate acoefficient based on location information. Objects that aregeographically closer to each other may be considered to be more relatedor of more interest to each other than more distant objects. Inparticular embodiments, the coefficient of a user towards a particularobject may be based on the proximity of the object's location to acurrent location associated with the user (or the location of a clientsystem 130 of the user). A first user may be more interested in otherusers or concepts that are closer to the first user. As an example andnot by way of limitation, if a user is one mile from an airport and twomiles from a gas station, social-networking system 160 may determinethat the user has a higher coefficient for the airport than the gasstation based on the proximity of the airport to the user.

In particular embodiments, social-networking system 160 may performparticular actions with respect to a user based on coefficientinformation. Coefficients may be used to predict whether a user willperform a particular action based on the user's interest in the action.A coefficient may be used when generating or presenting any type ofobjects to a user, such as advertisements, search results, news stories,media, messages, notifications, or other suitable objects. Thecoefficient may also be utilized to rank and order such objects, asappropriate. In this way, social-networking system 160 may provideinformation that is relevant to user's interests and currentcircumstances, increasing the likelihood that they will find suchinformation of interest. In particular embodiments, social-networkingsystem 160 may generate content based on coefficient information.Content objects may be provided or selected based on coefficientsspecific to a user. As an example and not by way of limitation, thecoefficient may be used to generate media for the user, where the usermay be presented with media for which the user has a high overallcoefficient with respect to the media object. As another example and notby way of limitation, the coefficient may be used to generateadvertisements for the user, where the user may be presented withadvertisements for which the user has a high overall coefficient withrespect to the advertised object. In particular embodiments,social-networking system 160 may generate search results based oncoefficient information. Search results for a particular user may bescored or ranked based on the coefficient associated with the searchresults with respect to the querying user. As an example and not by wayof limitation, search results corresponding to objects with highercoefficients may be ranked higher on a search-results page than resultscorresponding to objects having lower coefficients.

In particular embodiments, social-networking system 160 may calculate acoefficient in response to a request for a coefficient from a particularsystem or process. To predict the likely actions a user may take (or maybe the subject of) in a given situation, any process may request acalculated coefficient for a user. The request may also include a set ofweights to use for various factors used to calculate the coefficient.This request may come from a process running on the online socialnetwork, from a third-party system 170 (e.g., via an API or othercommunication channel), or from another suitable system. In response tothe request, social-networking system 160 may calculate the coefficient(or access the coefficient information if it has previously beencalculated and stored). In particular embodiments, social-networkingsystem 160 may measure an affinity with respect to a particular process.Different processes (both internal and external to the online socialnetwork) may request a coefficient for a particular object or set ofobjects. Social-networking system 160 may provide a measure of affinitythat is relevant to the particular process that requested the measure ofaffinity. In this way, each process receives a measure of affinity thatis tailored for the different context in which the process will use themeasure of affinity.

In connection with social-graph affinity and affinity coefficients,particular embodiments may utilize one or more systems, components,elements, functions, methods, operations, or steps disclosed in U.S.patent application Ser. No. 11/503,093, filed 11 Aug. 2006, U.S. patentapplication Ser. No. 12/977,027, filed 22 Dec. 2010, U.S. patentapplication Ser. No. 12/978,265, filed 23 Dec. 2010, and U.S. patentapplication Ser. No. 13/632,869, field 1 Oct. 2012, each of which isincorporated by reference.

Systems and Methods

FIG. 14 illustrates an example computer system 1400. In particularembodiments, one or more computer systems 1400 perform one or more stepsof one or more methods described or illustrated herein. In particularembodiments, one or more computer systems 1400 provide functionalitydescribed or illustrated herein. In particular embodiments, softwarerunning on one or more computer systems 1400 performs one or more stepsof one or more methods described or illustrated herein or providesfunctionality described or illustrated herein. Particular embodimentsinclude one or more portions of one or more computer systems 1400.Herein, reference to a computer system may encompass a computing device,and vice versa, where appropriate. Moreover, reference to a computersystem may encompass one or more computer systems, where appropriate.

This disclosure contemplates any suitable number of computer systems1400. This disclosure contemplates computer system 1400 taking anysuitable physical form. As example and not by way of limitation,computer system 1400 may be an embedded computer system, asystem-on-chip (SOC), a single-board computer system (SBC) (such as, forexample, a computer-on-module (COM) or system-on-module (SOM)), adesktop computer system, a laptop or notebook computer system, aninteractive kiosk, a mainframe, a mesh of computer systems, a mobiletelephone, a personal digital assistant (PDA), a server, a tabletcomputer system, or a combination of two or more of these. Whereappropriate, computer system 1400 may include one or more computersystems 1400; be unitary or distributed; span multiple locations; spanmultiple machines; span multiple data centers; or reside in a cloud,which may include one or more cloud components in one or more networks.Where appropriate, one or more computer systems 1400 may perform withoutsubstantial spatial or temporal limitation one or more steps of one ormore methods described or illustrated herein. As an example and not byway of limitation, one or more computer systems 1400 may perform in realtime or in batch mode one or more steps of one or more methods describedor illustrated herein. One or more computer systems 1400 may perform atdifferent times or at different locations one or more steps of one ormore methods described or illustrated herein, where appropriate.

In particular embodiments, computer system 1400 includes a processor1402, memory 1404, storage 1406, an input/output (I/O) interface 1408, acommunication interface 1410, and a bus 1412. Although this disclosuredescribes and illustrates a particular computer system having aparticular number of particular components in a particular arrangement,this disclosure contemplates any suitable computer system having anysuitable number of any suitable components in any suitable arrangement.

In particular embodiments, processor 1402 includes hardware forexecuting instructions, such as those making up a computer program. Asan example and not by way of limitation, to execute instructions,processor 1402 may retrieve (or fetch) the instructions from an internalregister, an internal cache, memory 1404, or storage 1406; decode andexecute them; and then write one or more results to an internalregister, an internal cache, memory 1404, or storage 1406. In particularembodiments, processor 1402 may include one or more internal caches fordata, instructions, or addresses. This disclosure contemplates processor1402 including any suitable number of any suitable internal caches,where appropriate. As an example and not by way of limitation, processor1402 may include one or more instruction caches, one or more datacaches, and one or more translation lookaside buffers (TLBs).Instructions in the instruction caches may be copies of instructions inmemory 1404 or storage 1406, and the instruction caches may speed upretrieval of those instructions by processor 1402. Data in the datacaches may be copies of data in memory 1404 or storage 1406 forinstructions executing at processor 1402 to operate on; the results ofprevious instructions executed at processor 1402 for access bysubsequent instructions executing at processor 1402 or for writing tomemory 1404 or storage 1406; or other suitable data. The data caches mayspeed up read or write operations by processor 1402. The TLBs may speedup virtual-address translation for processor 1402. In particularembodiments, processor 1402 may include one or more internal registersfor data, instructions, or addresses. This disclosure contemplatesprocessor 1402 including any suitable number of any suitable internalregisters, where appropriate. Where appropriate, processor 1402 mayinclude one or more arithmetic logic units (ALUs); be a multi-coreprocessor; or include one or more processors 1402. Although thisdisclosure describes and illustrates a particular processor, thisdisclosure contemplates any suitable processor.

In particular embodiments, memory 1404 includes main memory for storinginstructions for processor 1402 to execute or data for processor 1402 tooperate on. As an example and not by way of limitation, computer system1400 may load instructions from storage 1406 or another source (such as,for example, another computer system 1400) to memory 1404. Processor1402 may then load the instructions from memory 1404 to an internalregister or internal cache. To execute the instructions, processor 1402may retrieve the instructions from the internal register or internalcache and decode them. During or after execution of the instructions,processor 1402 may write one or more results (which may be intermediateor final results) to the internal register or internal cache. Processor1402 may then write one or more of those results to memory 1404. Inparticular embodiments, processor 1402 executes only instructions in oneor more internal registers or internal caches or in memory 1404 (asopposed to storage 1406 or elsewhere) and operates only on data in oneor more internal registers or internal caches or in memory 1404 (asopposed to storage 1406 or elsewhere). One or more memory buses (whichmay each include an address bus and a data bus) may couple processor1402 to memory 1404. Bus 1412 may include one or more memory buses, asdescribed below. In particular embodiments, one or more memorymanagement units (MMUs) reside between processor 1402 and memory 1404and facilitate accesses to memory 1404 requested by processor 1402. Inparticular embodiments, memory 1404 includes random access memory (RAM).This RAM may be volatile memory, where appropriate Where appropriate,this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, whereappropriate, this RAM may be single-ported or multi-ported RAM. Thisdisclosure contemplates any suitable RAM. Memory 1404 may include one ormore memories 1404, where appropriate. Although this disclosuredescribes and illustrates particular memory, this disclosurecontemplates any suitable memory.

In particular embodiments, storage 1406 includes mass storage for dataor instructions. As an example and not by way of limitation, storage1406 may include a hard disk drive (HDD), a floppy disk drive, flashmemory, an optical disc, a magneto-optical disc, magnetic tape, or aUniversal Serial Bus (USB) drive or a combination of two or more ofthese. Storage 1406 may include removable or non-removable (or fixed)media, where appropriate. Storage 1406 may be internal or external tocomputer system 1400, where appropriate. In particular embodiments,storage 1406 is non-volatile, solid-state memory. In particularembodiments, storage 1406 includes read-only memory (ROM). Whereappropriate, this ROM may be mask-programmed ROM, programmable ROM(PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM),electrically alterable ROM (EAROM), or flash memory or a combination oftwo or more of these. This disclosure contemplates mass storage 1406taking any suitable physical form. Storage 1406 may include one or morestorage control units facilitating communication between processor 1402and storage 1406, where appropriate. Where appropriate, storage 1406 mayinclude one or more storages 1406. Although this disclosure describesand illustrates particular storage, this disclosure contemplates anysuitable storage.

In particular embodiments, I/O interface 1408 includes hardware,software, or both, providing one or more interfaces for communicationbetween computer system 1400 and one or more I/O devices. Computersystem 1400 may include one or more of these I/O devices, whereappropriate. One or more of these I/O devices may enable communicationbetween a person and computer system 1400. As an example and not by wayof limitation, an I/O device may include a keyboard, keypad, microphone,monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet,touch screen, trackball, video camera, another suitable I/O device or acombination of two or more of these. An I/O device may include one ormore sensors. This disclosure contemplates any suitable I/O devices andany suitable I/O interfaces 1408 for them. Where appropriate, I/Ointerface 1408 may include one or more device or software driversenabling processor 1402 to drive one or more of these I/O devices. I/Ointerface 1408 may include one or more I/O interfaces 1408, whereappropriate. Although this disclosure describes and illustrates aparticular I/O interface, this disclosure contemplates any suitable I/Ointerface.

In particular embodiments, communication interface 1410 includeshardware, software, or both providing one or more interfaces forcommunication (such as, for example, packet-based communication) betweencomputer system 1400 and one or more other computer systems 1400 or oneor more networks. As an example and not by way of limitation,communication interface 1410 may include a network interface controller(NIC) or network adapter for communicating with an Ethernet or otherwire-based network or a wireless NIC (WNIC) or wireless adapter forcommunicating with a wireless network, such as a WI-FI network. Thisdisclosure contemplates any suitable network and any suitablecommunication interface 1410 for it. As an example and not by way oflimitation, computer system 1400 may communicate with an ad hoc network,a personal area network (PAN), a local area network (LAN), a wide areanetwork (WAN), a metropolitan area network (MAN), or one or moreportions of the Internet or a combination of two or more of these. Oneor more portions of one or more of these networks may be wired orwireless. As an example, computer system 1400 may communicate with awireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FInetwork, a WI-MAX network, a cellular telephone network (such as, forexample, a Global System for Mobile Communications (GSM) network), orother suitable wireless network or a combination of two or more ofthese. Computer system 1400 may include any suitable communicationinterface 1410 for any of these networks, where appropriate.Communication interface 1410 may include one or more communicationinterfaces 1410, where appropriate. Although this disclosure describesand illustrates a particular communication interface, this disclosurecontemplates any suitable communication interface.

In particular embodiments, bus 1412 includes hardware, software, or bothcoupling components of computer system 1400 to each other. As an exampleand not by way of limitation, bus 1412 may include an AcceleratedGraphics Port (AGP) or other graphics bus, an Enhanced Industry StandardArchitecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT)interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBANDinterconnect, a low-pin-count (LPC) bus, a memory bus, a Micro ChannelArchitecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, aPCI-Express (PCIe) bus, a serial advanced technology attachment (SATA)bus, a Video Electronics Standards Association local (VLB) bus, oranother suitable bus or a combination of two or more of these. Bus 1412may include one or more buses 1412, where appropriate. Although thisdisclosure describes and illustrates a particular bus, this disclosurecontemplates any suitable bus or interconnect.

Herein, a computer-readable non-transitory storage medium or media mayinclude one or more semiconductor-based or other integrated circuits(ICs) (such, as for example, field-programmable gate arrays (FPGAs) orapplication-specific ICs (ASICs)), hard disk drives (HDDs), hybrid harddrives (HHDs), optical discs, optical disc drives (ODDs),magneto-optical discs, magneto-optical drives, floppy diskettes, floppydisk drives (FDDs), magnetic tapes, solid-state drives (SSDs),RAM-drives, SECURE DIGITAL cards or drives, any other suitablecomputer-readable non-transitory storage media, or any suitablecombination of two or more of these, where appropriate. Acomputer-readable non-transitory storage medium may be volatile,non-volatile, or a combination of volatile and non-volatile, whereappropriate.

Miscellaneous

Herein, “or” is inclusive and not exclusive, unless expressly indicatedotherwise or indicated otherwise by context. Therefore, herein, “A or B”means “A, B, or both,” unless expressly indicated otherwise or indicatedotherwise by context. Moreover, “and” is both joint and several, unlessexpressly indicated otherwise or indicated otherwise by context.Therefore, herein, “A and B” means “A and B, jointly or severally,”unless expressly indicated otherwise or indicated otherwise by context.

The scope of this disclosure encompasses all changes, substitutions,variations, alterations, and modifications to the example embodimentsdescribed or illustrated herein that a person having ordinary skill inthe art would comprehend. The scope of this disclosure is not limited tothe example embodiments described or illustrated herein. Moreover,although this disclosure describes and illustrates respectiveembodiments herein as including particular components, elements,functions, operations, or steps, any of these embodiments may includeany combination or permutation of any of the components, elements,functions, operations, or steps described or illustrated anywhere hereinthat a person having ordinary skill in the art would comprehend.Furthermore, reference in the appended claims to an apparatus or systemor a component of an apparatus or system being adapted to, arranged to,capable of, configured to, enabled to, operable to, or operative toperform a particular function encompasses that apparatus, system,component, whether or not it or that particular function is activated,turned on, or unlocked, as long as that apparatus, system, or componentis so adapted, arranged, capable, configured, enabled, operable, oroperative.

What is claimed is:
 1. A method comprising, by a computing device:accessing a social graph comprising a plurality of nodes and a pluralityof edges connecting the nodes, each of the edges between two of thenodes representing a single degree of separation between them, the nodescomprising: a first node corresponding to a first user associated withan online social network; and a plurality of second nodes correspondingto a plurality of second users associated with the online socialnetwork, respectively; receiving, from a social-networking applicationof the online social network on a client device of the first user, arequest for a user-list comprising one or more of the second users;calculating, for each of one or more second users, a contact-scorebetween the first user and the second user, wherein the contact-scorefor each second user is based at least in part on: one or more socialinteractions between the first user and the second user, the socialinteractions being interactions on the online social network, eachsocial interaction being represented as an edge in the social graphconnecting the first node and a second node corresponding to the seconduser, wherein the one or more social interactions are visible to thefirst user based on privacy settings associated with the second node orwith the edge representing the respective social interaction; and one ormore non-social interactions between the first user and the second user,the non-social interactions comprising at least one or more interactionsbetween the first user and the second user on a third-party applicationon the client device and being accessed by the social-networkingapplication of the online social network from the third-partyapplication on the client device, wherein the non-social interactionsare shared with the social-networking application based on a privacysetting associated with the third-party application; generating theuser-list comprising references to one or more second users having acontact-score with respect to the first user above a thresholdcontact-score; and sending, to the social-networking application on theclient device responsive to the request, the user-list for display tothe first user.
 2. The method of claim 1, wherein the user-list isdisplayed on a user interface of a native application associated withthe online social network.
 3. The method of claim 1, wherein theuser-list is displayed on a webpage associated with the online socialnetwork accessed by a browser client.
 4. The method of claim 1, whereinthe user-list comprises one or more interactive elements associated witheach second user referenced on the user-list.
 5. The method of claim 4,wherein the one or more interactive elements are operable to: send afriend request to the referenced second user; accept a friend requestfrom the referenced second user; modify a privacy setting with respectto the referenced second user; modify a friend connection with respectto the referenced second user; send a message to the referenced seconduser; initiate a voice call with the referenced second user; or viewadditional information about the referenced second user.
 6. The methodof claim 1, wherein the non-social interactions are recorded by athird-party application of the social-networking system.
 7. The methodof claim 1, wherein the non-social interactions between the first userand the second user comprise one or more of: a phone call between thefirst user and the second user; an SMS or MMS message between the firstuser and the second user; an email message between the first user andthe second user; an event attended by the first user and the seconduser; the first user and the second user having substantially the samegeographic location at substantially the same time; or an address bookentry of the first user or the second user.
 8. The method of claim 1,wherein the user-list is an ordered list of one or more second usersbased on the contact-score for each second user.
 9. The method of claim1, wherein the user-list comprises references to one or more secondusers who are first-degree connections of the first user within thesocial graph.
 10. The method of claim 1, wherein the user-list comprisesreferences to one or more second users who are not connected to thefirst user within the social graph.
 11. The method of claim 1, whereinthe user-list contains information about the contact-score for eachsecond user.
 12. The method of claim 1, further comprising: applying aquery-filter to the user-list; updating the contact-scores of the one ormore second users based at least in part on the query-filter, andgenerating a new version of the user-list based on the updatedcontact-scores; and sending a revised user-list to the first user fordisplay.
 13. The method of claim 1, wherein the first user may removeone or more second users from the user-list.
 14. The method of claim 1,wherein references to one or more second users comprise: an imageassociated with the referenced second user; the name of the referencedsecond user; an email address associated with the reference second user;contact information associated with the referenced second user; a userID associated with the referenced second user; or user-profileinformation on the social-networking system associated with thereferenced second user.
 15. The method of claim 1, wherein thecontact-score for each second user is based at least in part on one ormore interactions by the second user that have a visibility that is notvisible to the first user based on privacy settings associated with thesecond user.
 16. The method of claim 1, wherein the contact-score foreach second user is based at least in part on one or more interactionsby the first user that have a visibility that is not visible to thesecond user based on privacy settings associated with the first user.17. The method of claim 1, further comprising: receiving an input fromthe first user to filter the user-list by a particular time period;re-calculating, for each of one or more second users, a contact-scorebetween the first user and the second user based on interactions betweenthe first user and the second user within the particular time period;updating the user-list comprising references to one or more second usershaving a re-calculated contact-score above a threshold contact-score;and sending, in response to the input, the updated user-list to thefirst user for display.
 18. The method of claim 1, wherein theparticular time period extends to the current time of the input by thefirst user.
 19. One or more computer-readable non-transitory storagemedia embodying software that is operable when executed to: access asocial graph comprising a plurality of nodes and a plurality of edgesconnecting the nodes, each of the edges between two of the nodesrepresenting a single degree of separation between them, the nodescomprising: a first node corresponding to a first user associated withan online social network; and a plurality of second nodes correspondingto a plurality of second users associated with the online socialnetwork, respectively; receive, from a social-networking application ofthe online social network on a client device of the first user, arequest for a user-list comprising one or more of the second users;calculate, for each of one or more second users, a contact-score betweenthe first user and the second user, wherein the contact-score for eachsecond user is based at least in part on: one or more socialinteractions between the first user and the second user, the socialinteractions being interactions on the online social network, eachsocial interaction being represented as an edge in the social graphconnecting the first node and a second node corresponding to the seconduser, wherein the one or more social interactions are visible to thefirst user based on privacy settings associated with the second node orwith the edge representing the respective social interaction; and one ormore non-social interactions between the first user and the second user,the non-social interactions comprising at least one or more interactionsbetween the first user and the second user on a third-party applicationon the client device and being accessed by the social-networkingapplication of the online social network from the third-partyapplication on the client device, wherein the non-social interactionsare shared with the social-networking application based on a privacysetting associated with the third-party application; generate theuser-list comprising references to one or more second users having acontact-score with respect to the first user above a thresholdcontact-score; and send, to the social-networking application on theclient device responsive to the request, the user-list for display tothe first user.
 20. A system comprising: one or more processors; and amemory coupled to the processors comprising instructions executable bythe processors, the processors operable when executing the instructionsto: access a social graph comprising a plurality of nodes and aplurality of edges connecting the nodes, each of the edges between twoof the nodes representing a single degree of separation between them,the nodes comprising: a first node corresponding to a first userassociated with an online social network; and a plurality of secondnodes corresponding to a plurality of second users associated with theonline social network, respectively; receive, from a social-networkingapplication of the online social network on a client device of the firstuser, a request for a user-list comprising one or more of the secondusers; calculate, for each of one or more second users, a contact-scorebetween the first user and the second user, wherein the contact-scorefor each second user is based at least in part on: one or more socialinteractions between the first user and the second user, the socialinteractions being interactions on the online social network, eachsocial interaction being represented as an edge in the social graphconnecting the first node and a second node corresponding to the seconduser, wherein the one or more social interactions are visible to thefirst user based on privacy settings associated with the second node orwith the edge representing the respective social interaction; and one ormore non-social interactions between the first user and the second user,the non-social interactions comprising at least one or more interactionsbetween the first user and the second user on a third-party applicationon the client device and being accessed by the social-networkingapplication of the online social network from the third-partyapplication on the client device, wherein the non-social interactionsare shared with the social-networking application based on a privacysetting associated with the third-party application; generate theuser-list comprising references to one or more second users having acontact-score with respect to the first user above a thresholdcontact-score; and send, to the social-networking application on theclient device responsive to the request, the user-list for display tothe first user.
 21. The method of claim 1, wherein the contact-score foreach second user is a composite contact-score comprising: a firstweighting factor applied to a first component of the contact-score basedon the social interactions; and a second weighting factor applied to asecond component of the contact-score based on the non-socialinteractions.
 22. The media of claim 19, wherein the user-list isdisplayed on a user interface of a native application associated withthe online social network.
 23. The media of claim 19, wherein theuser-list is displayed on a webpage associated with the online socialnetwork accessed by a browser client.
 24. The media of claim 19, whereinthe user-list comprises one or more interactive elements associated witheach second user referenced on the user-list.
 25. The media of claim 24,wherein the one or more interactive elements are operable to: send afriend request to the referenced second user; accept a friend requestfrom the referenced second user; modify a privacy setting with respectto the referenced second user; modify a friend connection with respectto the referenced second user; send a message to the referenced seconduser; initiate a voice call with the referenced second user; or viewadditional information about the referenced second user.
 26. The mediaof claim 19, wherein the non-social interactions are recorded by athird-party application of the social-networking system.
 27. The mediaof claim 19, wherein the non-social interactions between the first userand the second user comprise one or more of: a phone call between thefirst user and the second user; an SMS or MMS message between the firstuser and the second user; an email message between the first user andthe second user; an event attended by the first user and the seconduser; the first user and the second user having substantially the samegeographic location at substantially the same time; or an address bookentry of the first user or the second user.
 28. The media of claim 19,wherein the user-list is an ordered list of one or more second usersbased on the contact-score for each second user.
 29. The media of claim19, wherein the user-list comprises references to one or more secondusers who are first-degree connections of the first user within thesocial graph.
 30. The media of claim 19, wherein the user-list comprisesreferences to one or more second users who are not connected to thefirst user within the social graph.
 31. The media of claim 19, whereinthe user-list contains information about the contact-score for eachsecond user.
 32. The media of claim 19, wherein the software is furtheroperable when executed to: apply a query-filter to the user-list; updatethe contact-scores of the one or more second users based at least inpart on the query-filter, and generating a new version of the user-listbased on the updated contact-scores; and send a revised user-list to thefirst user for display.
 33. The media of claim 19, wherein the firstuser may remove one or more second users from the user-list.
 34. Themedia of claim 19, wherein references to one or more second userscomprise: an image associated with the referenced second user; the nameof the referenced second user; an email address associated with thereference second user; contact information associated with thereferenced second user; a user ID associated with the referenced seconduser; or user-profile information on the social-networking systemassociated with the referenced second user.
 35. The media of claim 19,wherein the contact-score for each second user is based at least in parton one or more interactions by the second user that have a visibilitythat is not visible to the first user based on privacy settingsassociated with the second user.
 36. The media of claim 19, wherein thecontact-score for each second user is based at least in part on one ormore interactions by the first user that have a visibility that is notvisible to the second user based on privacy settings associated with thefirst user.
 37. The media of claim 19, wherein the software is furtheroperable when executed to: receive an input from the first user tofilter the user-list by a particular time period; re-calculate, for eachof one or more second users, a contact-score between the first user andthe second user based on interactions between the first user and thesecond user within the particular time period; update the user-listcomprising references to one or more second users having a re-calculatedcontact-score above a threshold contact-score; and send, in response tothe input, the updated user-list to the first user for display.
 38. Themedia of claim 19, wherein the particular time period extends to thecurrent time of the input by the first user.
 39. The media of claim 19,wherein the contact-score for each second user is a compositecontact-score comprising: a first weighting factor applied to a firstcomponent of the contact-score based on the social interactions; and asecond weighting factor applied to a second component of thecontact-score based on the non-social interactions.
 40. The system ofclaim 20, wherein the user-list is displayed on a user interface of anative application associated with the online social network.
 41. Thesystem of claim 20, wherein the user-list is displayed on a webpageassociated with the online social network accessed by a browser client.42. The system of claim 20, wherein the user-list comprises one or moreinteractive elements associated with each second user referenced on theuser-list.
 43. The system of claim 42, wherein the one or moreinteractive elements are operable to: send a friend request to thereferenced second user; accept a friend request from the referencedsecond user; modify a privacy setting with respect to the referencedsecond user; modify a friend connection with respect to the referencedsecond user; send a message to the referenced second user; initiate avoice call with the referenced second user; or view additionalinformation about the referenced second user.
 44. The system of claim20, wherein the non-social interactions are recorded by a third-partyapplication of the social-networking system.
 45. The system of claim 20,wherein the non-social interactions between the first user and thesecond user comprise one or more of: a phone call between the first userand the second user; an SMS or MMS message between the first user andthe second user; an email message between the first user and the seconduser; an event attended by the first user and the second user; the firstuser and the second user having substantially the same geographiclocation at substantially the same time; or an address book entry of thefirst user or the second user.
 46. The system of claim 20, wherein theuser-list is an ordered list of one or more second users based on thecontact-score for each second user.
 47. The system of claim 20, whereinthe user-list comprises references to one or more second users who arefirst-degree connections of the first user within the social graph. 48.The system of claim 20, wherein the user-list comprises references toone or more second users who are not connected to the first user withinthe social graph.
 49. The system of claim 20, wherein the user-listcontains information about the contact-score for each second user. 50.The system of claim 20, wherein the processors are further operable whenexecuting the instructions to: apply a query-filter to the user-list;update the contact-scores of the one or more second users based at leastin part on the query-filter, and generating a new version of theuser-list based on the updated contact-scores; and send a reviseduser-list to the first user for display.
 51. The system of claim 20,wherein the first user may remove one or more second users from theuser-list.
 52. The system of claim 20, wherein references to one or moresecond users comprise: an image associated with the referenced seconduser; the name of the referenced second user; an email addressassociated with the reference second user; contact informationassociated with the referenced second user; a user ID associated withthe referenced second user; or user-profile information on thesocial-networking system associated with the referenced second user. 53.The system of claim 20, wherein the contact-score for each second useris based at least in part on one or more interactions by the second userthat have a visibility that is not visible to the first user based onprivacy settings associated with the second user.
 54. The system ofclaim 20, wherein the contact-score for each second user is based atleast in part on one or more interactions by the first user that have avisibility that is not visible to the second user based on privacysettings associated with the first user.
 55. The system of claim 20,wherein the processors are further operable when executing theinstructions to: receive an input from the first user to filter theuser-list by a particular time period; re-calculate, for each of one ormore second users, a contact-score between the first user and the seconduser based on interactions between the first user and the second userwithin the particular time period; update the user-list comprisingreferences to one or more second users having a re-calculatedcontact-score above a threshold contact-score; and send, in response tothe input, the updated user-list to the first user for display.
 56. Thesystem of claim 20, wherein the particular time period extends to thecurrent time of the input by the first user.
 57. The system of claim 20,wherein the contact-score for each second user is a compositecontact-score comprising: a first weighting factor applied to a firstcomponent of the contact-score based on the social interactions; and asecond weighting factor applied to a second component of thecontact-score based on the non-social interactions.